Subexponential algorithms for unique games and related problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 563-572

  Arora, Sanjeev ^a   Barak, Boaz ^a,b   Steurer, David ^a,c  

^a Princeton University   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Approximation algorithms; Constraint satisfaction problems; Eigenvalues; Graph decompositions; Spectral methods; Subexponential algorithms; Unique games

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH ALGORITHMS; GRAPH THEORY; NP-HARD; STOCHASTIC SYSTEMS;

EIGENVALUES; GRAPH DECOMPOSITIONS; SPECTRAL METHODS; SUB-EXPONENTIAL ALGORITHMS; UNIQUE GAMES;

APPROXIMATION ALGORITHMS;

EID: 78751539332     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.59     Document Type: Conference Paper

References (38)

1. 1; isoperimetric inequalities for graphs, and superconcentrators," J. Combin. Theory Ser. B, vol. 38, no. 1, pp. 73-88, 1985. [Online]. Available: http://dx.doi.org/10. 1016/0095-8956(85)90092-9
2. N. Alon and B. Klartag, "Economical toric spines via Cheeger's inequality," J. Topol. Anal., vol. 1, no. 2, pp. 101-111, 2009. [Online]. Available: http://dx.doi.org/10.1142/S1793525309000096
3. S. Arora, R. Impagliazzo, W. Matthews, and D. Steurer, "Improved algorithms for unique games via divide and conquer," ECCC, Tech. Rep. ECCC TR10-041, 2010.
4. S. Arora, S. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. Vishnoi, "Unique games on expanding constraints graphs are easy," in Proc. 40th STOC. ACM, 2008.
5. B. Barak, M. Hardt, T. Holenstein, and D. Steurer, "Subsampling mathematical relaxations and average-case complexity," 2010, manuscript.
6. A. Bulatov, P. Jeavons, and A. Krokhin, "Classifying the complexity of constraints using finite algebras," SIAM J. Comput, vol. 34, no. 3, pp. 720-742, 2005, prelim version in ICALP '00.
7. M. Charikar, K. Makarychev, and Y. Makarychev, "Near-optimal algorithms for unique games," in STOC, 2006, pp. 205-214.
8. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar, "On the hardness of approximating multicut and sparsest-cut," Computational Complexity, vol. 15, no. 2, pp. 94-114, 2006, prelim version in CCC 2005.
9. J. Cheeger, "A lower bound for the smallest eigenvalue of the Laplacian," in Problems in analysis (Papers dedicated to Salomon Bochner, 1969). Princeton Univ. Press, 1970, pp. 195-199.
10. C. Chekuri and M. Pal, "A recursive greedy algorithm for walks in directed graphs," in Proc. FOCS, 2005, pp. 245-253.
11. E. Chlamtac, K. Makarychev, and Y. Makarychev, "How to play unique games using embeddings," in Proc. 47th FOCS. Citeseer, 2006, pp. 687-696.
12. T. Dimitriou and R. Impagliazzo, "Go with the winners for graph bisection," in Proc 9th SODA, 1998, pp. 510-520.
13. U. Feige and D. Reichman, "On systems of linear equations with two variables per equation," Proc. of RANDOM-APPROX, pp. 117-127, 2004.
14. A. M. Frieze and R. Kannan, "Quick approximation to matrices and applications," Combinatorica, vol. 19, no. 2, pp. 175-220, 1999.
15. S. Goel, R. Montenegro, and P. Tetali, "Mixing time bounds via the spectral profile," Electron. J. Probab., vol. 11, pp. no. 1, 1-26 (electronic), 2006.
16. A. Gupta and K. Talwar, "Approximating unique games," in Proc. 17th SODA. ACM, 2006, p. 106.
17. A. Gupta, R. Krauthgamer, and J. R. Lee, "Bounded geometries, fractals, and low-distortion embeddings," in FOCS, 2003, pp. 534-543.
18. J. Håstad, "Some optimal inapproximability results," J. ACM, vol. 48, no. 4, pp. 798-859, 2001, prelim version STOC '97.
19. R. Impagliazzo, R. Paturi, and F. Zane, "Which problems have strongly exponential complexity?" Journal of Computer and System Sciences, vol. 63, no. 4, pp. 512-530, 2001.
20. S. Khot, "On the power of unique 2-prover 1-round games," in Proceedings of 34th STOC. New York: ACM Press, 2002, pp. 767-775.
21. -, "On the unique games conjecture (invited survey)," Computational Complexity, Annual IEEE Conference on, vol. 0, pp. 99-121, 2010.
22. 1-embeddability," in FOCS, 2009, pp. 565-574.
23. 1," in FOCS, 2005, pp. 53-62.
24. A. Kolla, "Spectral algorithms for unique games," in Proc. CCC, 2010, to appear.
25. A. Kolla and M. Tulsiani, "Playing random and expanding unique games," 2007, unpublished manuscript available from the authors' webpages, to appear in journal version of [4].
26. G. Kun and M. Szegedy, "A new line of attack on the dichotomy conjecture," in Proceedings of the 41st annual ACM symposium on Symposium on theory of computing. ACM New York, NY, USA, 2009, pp. 725-734.
27. A. K. Lenstra and H. W. J. Lenstra, The Development of the Number Field Sieve. Springer-Verlag, 1993.
28. N. Linial and M. E. Saks, "Low diameter graph decompositions," Combinatorica, vol. 13, no. 4, pp. 441-454, 1993.
29. E. M. Luks, "Isomorphism of graphs of bounded valence can be tested in polynomial time," J. Comput. Syst. Sci., vol. 25, no. 1, pp. 42-65, 1982.
30. D. Moshkovitz and R. Raz, "Two query PCP with sub-constant error," in Proc. 49th FOCS, 2008, pp. 314-323.
31. A. Naor, "On the Banach space valued Azuma inequality and small set isoperimetry in Alon-Roichman graphs," 2004, unpublished manuscript.
32. P. Raghavendra, "Optimal algorithms and inapproximability results for every csp?" in Proc. 40th STOC. ACM, 2008, pp. 245-254.
33. P. Raghavendra and D. Steurer, "Integrality gaps for strong SDP relaxations of Unique Games," in FOCS, 2009, pp. 575-585.
34. -, "Graph expansion and the unique games conjecture," in STOC, 2010, to appear.
35. R. Stearns and H. Hunt III, "Power indices and easier hard problems," Math. Syst. Theory, vol. 23, no. 4, pp. 209-225, 1990.
36. D. Steurer, "Fast SDP algorithms for constraint satisfaction problems," in SODA, 2010, to appear.
37. E. Szemerédi, "Regular partitions of graphs," Problèmes combinatoires et théorie des graphes, Orsay, 1976.
38. L. Trevisan, "Approximation algorithms for unique games," in FOCS, 2005, pp. 197-205.