Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

These are the lecture notes for the DIMACS Tutorial "Limits of Approximation Algorithms: PCPs and Unique Games" held at the DIMACS Center, CoRE Building, Rutgers University on 20-21 July, 2009. This tutorial was jointly sponsored by the DIMACS Special Focus on Hardness of Approximation, the DIMACS Special Focus on Algorithmic Foundations of the Internet, and the Center for Computational Intractability with support from the National Security Agency and the National Science Foundation. The speakers at the tutorial were Matthew Andrews, Sanjeev Arora, Moses Charikar, Prahladh Harsha, Subhash Khot, Dana Moshkovitz and Lisa Zhang. The sribes were Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard and Gwen Spencer.

[1]  Matthew Andrews,et al.  Hardness of buy-at-bulk network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[2]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[3]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[4]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[5]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[6]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[7]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[8]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[9]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[10]  Jonas Holmerin,et al.  Towards optimal lower bounds for clique and chromatic number , 2003, Theor. Comput. Sci..

[11]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[12]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[13]  Ran Raz,et al.  Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Matthew Andrews,et al.  Complexity of wavelength assignment in optical network optimization , 2009, TNET.

[15]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[16]  Mohammad Taghi Hajiaghayi,et al.  Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[17]  Konstantin Makarychev,et al.  How to Play Unique Games on Expanders , 2010, WAOA.

[18]  Lisa Zhang,et al.  Almost-tight hardness of directed congestion minimization , 2008, JACM.

[19]  Sanjeev Khanna,et al.  An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow , 2006, Theory Comput..

[20]  M. Sudan,et al.  Robust pcps of proximity and shorter pcps , 2004 .

[21]  Elchanan Mossel,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, IEEE Annual Symposium on Foundations of Computer Science.

[22]  Moses Charikar,et al.  Near-optimal algorithms for unique games , 2006, STOC '06.

[23]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[24]  Yuval Rabani,et al.  ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[25]  Lisa Zhang,et al.  Complexity of Wavelength Assignment in Optical Network Optimization , 2006, IEEE/ACM Transactions on Networking.

[26]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[27]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[28]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[29]  Sanjeev Khanna,et al.  Hardness of Directed Routing with Congestion , 2006, Electron. Colloquium Comput. Complex..

[30]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[31]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[32]  Clifford Stein,et al.  Approximation Algorithms for Single-Source Unsplittable Flow , 2001, SIAM J. Comput..

[33]  Lisa Zhang,et al.  Hardness of the undirected congestion minimization problem , 2005, STOC '05.

[34]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[35]  Sanjeev Mahajan,et al.  Derandomizing Approximation Algorithms Based on Semidefinite Programming , 1999, SIAM J. Comput..

[36]  Nisheeth K. Vishnoi,et al.  Unique games on expanding constraint graphs are easy: extended abstract , 2008, STOC.

[37]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[38]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[39]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[40]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[41]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[42]  Luca Trevisan,et al.  Approximation algorithms for unique games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[43]  Subhash Khot.  Guest column: inapproximability results via Long Code based PCPs , 2005, SIGA.

[44]  Venkatesan Guruswami,et al.  Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs , 2010, Comb..

[45]  Yossi Azar,et al.  Combinatorial Algorithms for the Unsplittable Flow Problem , 2005, Algorithmica.

[46]  Eli Ben-Sasson,et al.  Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..

[47]  Venkatesan Guruswami,et al.  Hardness of routing with congestion in directed graphs , 2007, STOC '07.

[48]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[49]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[50]  Ganesh Venkataraman,et al.  Graph decomposition and a greedy algorithm for edge-disjoint paths , 2004, SODA '04.

[51]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[52]  Lisa Zhang,et al.  Logarithmic hardness of the undirected edge-disjoint paths problem , 2006, JACM.

[53]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.

[54]  Irit Dinur,et al.  Composition of Low-Error 2-Query PCPs Using Decodable PCPs , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[55]  R. Ravi,et al.  When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..

[56]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[57]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[58]  Venkatesan Guruswami,et al.  Hardness of Low Congestion Routing in Directed Graphs , 2006, Electron. Colloquium Comput. Complex..

[59]  Sanjeev Arora,et al.  Approximation schemes for NP-hard geometric optimization problems: a survey , 2003, Math. Program..

[60]  Ryan O'Donnell,et al.  Some topics in analysis of boolean functions , 2008, STOC.

[61]  Prasad Raghavendra,et al.  Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[62]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..

[63]  Anupam Gupta,et al.  Approximating unique games , 2006, SODA '06.

[64]  Thomas Erlebach,et al.  Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow , 2006, Efficient Approximation and Online Algorithms.

[65]  Aravind Srinivasan,et al.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..

[66]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[67]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[68]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[69]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[70]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.