Birs- 17w5133: Approximation Algorithms and the Hardness of Approximation
-
Title: Bimodular Integer Linear Programming and Beyond
Speaker:
Link:
-
Title: Improved Algorithms for MST and Metric-TSP Interdiction
Speaker:
Link:
-
Title: Stabilizing Weighted Graphs
Speaker:
Link:
-
Title: Algorithms for Stable and Perturbation-Resilient Problems
Speaker:
Link:
-
Title: From Gap-ETH to FPT Inapproximability: Clique, Dominating Set, and More
Speaker:
Link:
-
Title: (Almost) Settling the Complexity of Approximating Parameterized Dominating Set.
Speaker:
Link:
-
Title: A Simply Exponential upper bound on the Number of Stable Matchings
Speaker:
Link:
-
Title: Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices
Speaker:
Link:
-
Title: k-server via multi-scale entropic regulariziation
Speaker:
Link:
-
Title: Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree
Speaker:
Link:
-
Title: Faster algorithms for line search in the submodular base polytope
Speaker:
Link:
-
Title: Approximating Weighted Tree Augmentation via Chvatal-Gomory Cuts
Speaker:
Link:
-
Title: Approximating spanners and distance oracles.
Speaker:
Link:
-
Title: Learning mixtures of Gaussians under much less separation
Speaker:
Link:
-
Title: Learning Communities in the Presence of Errors
Speaker:
Link:
-
Title: Online Stochastic Scheduling using Posted Prices
Speaker:
Link:
-
Title: Approximation Schemes for Clustering Problems: Now With Outliers
Speaker:
Link:
-
Title: Online Covering with Sum of Lq-norm Objectives
Speaker:
Link:
-
Title: Semidefinite Programming Relaxations of the Traveling Salesman Problem
Speaker:
Link:
-
Title: Almost Polynomial Hardness of Node-Disjoint Paths in Grids
Speaker:
Link: