Birs- 14w5051: Approximation Algorithms and the Hardness of Approximation
-
Title: Effective Resistance Flows and Asymmetric TSP
Speaker:
Link:
-
Title: Ears and tours
Speaker:
Link:
-
Title: Computability of maximum entropy distributions and counting problems
Speaker:
Link:
-
Title: LP-Based algorithms for capacitated facility location
Speaker:
Link:
-
Title: Deliver or hold: Approximation algorithms for the periodic inventory routing problem
Speaker:
Link:
-
Title: Nonuniform graph partitioning with unrelated weights
Speaker:
Link:
-
Title: Constant factor approximation for balanced cut in the PIE model Tasos Sidiropoulos: Spectral concentration, robust k-center, and simple clustering
Speaker:
Link:
-
Title: Spectral concentration, robust k-center, and simple clustering
Speaker:
Link:
-
Title: On the power of symmetric LP/SDP relaxations
Speaker:
Link:
-
Title: TSP on regular graphs and beyond
Speaker:
Link:
-
Title: Region-growing and combinatorial algorithms for k-route cut problems
Speaker:
Link:
-
Title: Combinatorial algorithm for restricted max-min fair allocation
Speaker:
Link:
-
Title: Approximability of multiway partitioning problems and lower bounds from Sperner’s colorings
Speaker:
Link:
-
Title: (2+ε)-SAT is NP-hard
Speaker:
Link:
-
Title: Open questions in parallel repetition of games and PCPs
Speaker:
Link:
-
Title: Smoothed analysis of tensor decompositions
Speaker:
Link:
-
Title: On some recent MAX SAT approximation algorithms
Speaker:
Link:
-
Title: Limitations of greedy algorithms for MAX SAT
Speaker:
Link:
-
Title: Sum-of-squares method, tensor decomposition, and dictionary learning
Speaker:
Link:
-
Title: Constructive discrepancy minimization for convex sets
Speaker:
Link: