Birs- 23w5140: Approximation Algorithms and the Hardness of Approximation
-
Title: Approximating Weighted Connectivity Augmentation below Factor 2
Speaker:
Link:
-
Title: Thin Trees for Laminar Families
Speaker:
Link:
-
Title: Approximation Algorithms for Network Design in Non-Uniform Fault Models
Speaker:
Link:
-
Title: Edge-Augmentation Beyond Uncrossable Families
Speaker:
Link:
-
Title: One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
Speaker:
Link:
-
Title: Some progress in directed Steiner tree on planar graphs
Speaker:
Link:
-
Title: On Approximability of Satisfiable CSPs
Speaker:
Link:
-
Title: Almost Chor-Goldreich Sources and Adversarial Random Walks
Speaker:
Link:
-
Title: A Characterization of Approximability for Biased CSPs
Speaker:
Link:
-
Title: New Approximability Results for MAX CSPs
Speaker:
Link:
-
Title: The Joint Replenishment Problem with Outliers, and with Fairness Constraints
Speaker:
Link:
-
Title: The Subspace Flatness Conjecture and Faster Integer Programming
Speaker:
Link:
-
Title: Rounding Bipartite Matchings
Speaker:
Link:
-
Title: On Abelian Embeddings, Parallel Repetition and the GHZ game
Speaker:
Link:
-
Title: Set Selection under Explorable Stochastic Uncertainty via Covering Techniques
Speaker:
Link:
-
Title: Improved guarantees for the a priori TSP
Speaker:
Link:
-
Title: A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the Traveling Salesman Problem
Speaker:
Link:
-
Title: Baby PIH: Parameterized Inapproximability of Min CSP
Speaker:
Link:
-
Title: Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals
Speaker:
Link:
-
Title: Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering
Speaker:
Link: