Unique games on expanding constraint graphs are easy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 21-28

  Arora, Sanjeev ^a   Steurer, David ^a   Knot, Subhash A ^b   Tulsiani, Madhur ^c   Kolla, Alexandra ^c   Vishnoi, Nisheeth K ^d  

^a PRINCETON UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d IBM INDIA RESEARCH LAB   (India)

Author keywords

Approximation algorithms; Expander graphs; Semidehmte programming

Indexed keywords

APPROXIMATION ALGORITHMS;

CONSTRAINT GRAPH; EXPANDER GRAPHS; PARALLEL REPETITION; SEMIDEHMTE PROGRAMMING; UNIQUE GAMES;

COMPUTATION THEORY;

EID: 57049107485     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374380     Document Type: Conference Paper

References (22)

1. Christoph Ambühl, Monaldo Mastrolilli, and Ola, Svensson. Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling, In Annual Symposium on Foundations of Computer Science, number 48, 2007.
2. Sanjeev Arora, Satish Rao, and Umesh V. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the ACM Symposium on the Theory of Computing, number 36, pages 222-231, 2004.
3. Jin-yi Cai, Anne Condon, and Richard J. Lipton. Playing games of incomplete information. In the 7th Annual Symposium on Theoretical Aspects of Computer Science, pages 58-69, 1990.
4. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Near-optimal algorithms for unique games. In Proceedings of the ACM Symposium on the Theory of Computing, number 38, pages 205-214, 2006.
5. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In Computational Complexity, 15(2):94-114, 2006.
6. Eden Chlamtac, Konstantin Makarychev, Yury Makarychev. How to play unique games using embeddings. In Annual Symposium on Foundations of Computer Science, number 47, pages 687-696, 2006.
7. Nikhil Devanur, Subhash Khot, Rishi Saket, and Nisheeth K. Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. In Proceedings of the ACM Symposium on the Theory of Computing, number 38, pages 537-546, 2006.
8. Irit Dinur, Elchanan Mossel, and Oded Regev. Conditional hardness for approximate coloring. In Proceedings of the ACM Symposium on the Theory of Computing, number 38, pages 344-353, 2006.
9. Uriel Feige and László Lovász. Two-prover one-round proof systems, their power and their problems. In Proceedings of the ACM Symposium on the Theory of Computing, number 24, pages 733-744, 1992.
10. Anupam Gupta and Kunal Talwar. Approximating unique games. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete. Algorithms, pages 99-106, 2006.
11. Thomas Holenstein. Parallel repetition: simplifications and the no-signaling case. In Proceedings of the ACM Symposium on the Theory of Computing, number 39, pages 411-419, 2007.
12. Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the ACM Symposium on the Theory of Computing, number 34, pages 767-775, 2002.
13. Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O'Donnell. Optimal inapproximability results for max-cut and other 2-variable CSPs? in Annual Symposium on Foundations of Computer Science, number 45, pages 146-154, 2004,
14. Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2 - ε. In Proceedings of the Annual IEEE Conference on Computational Complexity, number 18, pages 379-386, 2003.
15. 1. In Annual Symposium on Foundations of Computer Science, number 46, pages 53-62, 2005.
16. Jean Bernard Lasserre. Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization, 11:796-817, 2001.
17. Monique Laurent. A comparison of the Sherali-Adams, Lovász- Schrijver and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research, 28(3):470-496, 2003.
18. László Lovász and Alexander Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization, 1(2): 166-190, 1991,
19. Ran Raz. A parallel repetition theorem. In SIAM Journal of Computing, 27(3):763-803, 1998.
20. Anup Rao. Parallel Repetition in Projection Games and a Concentration Bound In Proceedings of the. ACM Symposium on the Theory of Computing, number 40, 2008.
21. Shmuel Safra and Oded Schwartz. On Parallel-Repetition, Unique-Game and Max-Cut. Manuscript, 2007.
22. Luca Trevisan. Approximation algorithms for unique games. In Annual Symposium on Foundations of Computer Science, number 46, pages 197-205, 2005.