Graph expansion and the unique games conjecture

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 755-764

  Raghavendra, Prasad ^a   Steurer, David ^b  

^a MSR New England   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

graph expansion; hardness of approximation; spectral profile; unique games conjecture

Indexed keywords

DECISION VERSION; EDGE EXPANSION; GRAPH G; HARDNESS OF APPROXIMATION; NON-TRIVIAL; OPTIMIZATION PROBLEMS; REGULAR GRAPHS; SPARSEST CUT; SPECTRAL PROFILE; UNIQUE GAMES; UNIQUE GAMES CONJECTURE;

COMPUTATION THEORY; GRAPH THEORY; HARDNESS; OPTIMIZATION;

EXPANSION;

EID: 77954710865     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806792     Document Type: Conference Paper

References (25)

1. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
2. 1, isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory. Series B, 38:73-88, 1985.
3. S. Arora, R. Impagliazzo, W. Matthews, and D. Stuerer. Improved algorithms for unique games via divide and conquer. In Electronic Colloquium on Computational Complexity ECCCTR: TR10-041, 2010.
4. S. Arora, S. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. K. Vishnoi. Unique games on expanding constraint graphs are easy: extended abstract. In STOC, pages 21-28. ACM, 2008.
5. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the thirty-sixth annual ACM Symposium on Theory of Computing (STOC-04), pages 222-231, June 13-15 2004.
6. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, Feb. 1998.
7. B. Barak, M. Hardt, I. Haviv, A. Rao, O. Regev, and D. Steurer. Rounding parallel repetitions of unique games. In FOCS, pages 374-383. IEEE Computer Society, 2008.
8. M. Charikar, K. Makarychev, and Y. Makarychev. Integrality gaps for sherali-adams relaxations. In STOC, pages 283-292. ACM, 2009.
9. J. Cheeger. A lower bound on smallest eigenvalue of a laplacian. Problems in Analysis (Papers dedicated to Salomon Bochner), pages 195-199, 1970.
10. Feige and Schechtman. On the optimality of the random hyperplane rounding technique for MAX CUT. RSA: Random Structures Algorithms, 20, 2002.
11. U. Feige, G. Kindler, and R. O'Donnell. Understanding parallel repetition requires understanding foams. In IEEE Conference on Computational Complexity, pages 179-192, 2007.
12. K. Georgiou, A. Magen, T. Pitassi, and I. Tourlakis. Integrality gaps of 2 - o(1) for vertex cover SDPs in the lovész-schrijver hierarchy. In FOCS, pages 702-712. IEEE Computer Society, 2007.
13. S. Khot. On the power of unique 2-prover 1-round games. In STOC, pages 767-775. ACM, 2002.
14. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for max-cut and other 2-variable csps? SIAM J. Comput., 37(1):319-357, 2007.
15. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2-ε. J. Comput. Syst. Sci., 74(3):335-349, 2008.
16. 1. In FOCS, pages 53-62. IEEE Computer Society, 2005.
17. F. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
18. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
19. P. Raghavendra. Optimal algorithms and inapproximability results for every CSP? In STOC, pages 245-254. ACM, 2008.
20. P. Raghavendra and D. Steurer. How to round any CSP. In FOCS, pages 586-594. IEEE Computer Society, 2009.
21. P. Raghavendra and D. Steurer. Integrality gaps for strong SDP relaxations of UNIQUE GAMES. In FOCS, pages 575-585. IEEE Computer Society, 2009.
22. P. Raghavendra, D. Steurer, and P. Tetali. Approximations for the isoperimetric and spectral profile of graphs and for restricted eigenvalues of diagonally-dominant matrices. In STOC. ACM, 2010. To Appear.
23. A. Rao. Parallel repetition in projection games and a concentration bound. In STOC, pages 1-10. ACM, 2008.
24. R. Raz. A counterexample to strong parallel repetition. In FOCS, pages 369-373. IEEE Computer Society, 2008.
25. G. Schoenebeck, L. Trevisan, and M. Tulsiani. A linear round lower bound for Lovász-Schrijver SDP relaxations of vertex cover. In IEEE Conference on Computational Complexity, pages 205-216, 2007.