Spectral Algorithms for Unique Games

Computational Complexity

Volumn 20, Issue 2, 2011, Pages 177-206

  Kolla, Alexandra ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

algorithms; graph spectra; Unique games

Indexed keywords

EID: 79960559472     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-011-0011-7     Document Type: Article

References (24)

1. Sanjeev Arora, Boaz Barak & David Steurer (2010). Subexponential Algorithms for Unique Games and Related problems. In Proceedings of the 51st IEEE Symposium on Foundations of Computer Science.
2. Sanjeev Arora, Russell Impagliazzo, William Matthews & David Steurer (2009). Improved Algorithms for Unique Games via Divide and Conquer. Manuscript.
3. Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani & Nisheeth Vishnoi (2008). Unique Games on Expanding Constraint Graphs are Easy. In Proceedings of the ACM Symposium on the Theory of Computing, volume 40, 21-28.
4. Michael Artin (1991). Algebra. Prentice Hall.
5. Per Austrin (2010) Towards Sharp Inapproximability For Any 2-CSP. SIAM J. Comput. 39(6): 2430-2463.
6. Moses Charikar, Konstantin Makarychev & Yury Makarychev (2006). Near-optimal algorithms for Unique Games. In Proceedings of the ACM Symposium on the Theory of Computing, volume 38, 205-214.
7. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani & D. Sivakumar (2006). On the hardness of approximating multicut and sparsest-cut. In Computational Complexity, volume 15(2), 94-114.
8. Eden Chlamtac, Konstantin Makarychev & Yury Makarychev (2006). How to play Unique Games using embeddings. In Proceedings of the IEEE Symposium on Foundations of Computer Science, volume 48, 687-696.
9. Chandler Davis, Kahan W. M. (1970) The rotation of eigenvectors by a perturbation III. SIAM Journal on Numerical Analysis 7(1): 1-46.
10. Uriel Feige, Eran Ofek (2005) Spectral techniques applied to sparse random graphs. Random Structures and Algorithms 27(2): 251-275.
11. Anupam Gupta & Kunal Talwar (2006). Approximating Unique Games. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, volume 24, 99-106.
12. Petteri Kaski (2002). Eigenvectors and Spectra of Cayley Graphs. Available from: http://www. tcs. hut. fi/Studies/T-79. 300/2002S/esitelmat/kaski-paper-020506. pdf.
13. Subhash Khot (2002). On the power of unique 2-prover 1-round games. In Proceedings of the ACM Symposium on the Theory of Computing, volume 34, 767-775.
14. Subhash Khot, Guy Kindler, Elchanan Mossel & Ryan O'Donnell (2004). Optimal inapproximability results for max-cut and other 2-variable CSPs? In Proceedings of the IEEE Symposium on Foundations of Computer Science, volume 45, 146-154.
15. Subhash Khot & Oded Regev (2003). Vertex cover might be hard to approximate to within 2 - e{open}. In Proceedings of the IEEE Conference on Computational Complexity, volume 18, 379-386.
16. 1. In Proceedings of the IEEE Symposium on Foundations of Computer Science, volume 46, 53-62.
17. Alexandra Kolla & Madhur Tulsiani (2007). Playing Unique Games using graph spectra. URL http://www. cs. berkeley. edu/~akolla/UGspec. pdf. Manuscript.
18. Nati Linial (2007). Introduction to Fourier Analysis. Available from: http://www. cs. huji. ac. il/~nati/PAPERS/uw/lect01. pdf.
19. Yury Makarychev & Konstantin Makarychev (2009). How to play Unique Games on expanders. ECCC Report No. 21.
20. Prasad Raghavendra (2008). Optimal Algorithms and Inapproximability Results for Every CSP? In Proceedings of the ACM Symposium on the Theory of Computing, volume 40, 245-254.
21. Prasad Raghavendra & David Steurer (2009). Integrality gaps for strong SDP relaxations of Unique Games. In Proceedings of the 50th IEEE Symposium on Foundations of Computer Science, 575-585.
22. Prasad Raghavendra & David Steurer (2010). Graph Expansion and the Unique Games conjecture. In Proceedings of the 42nd ACM Symposium On The Theory Of Computing, volume 42, 755-764.
23. Daniel Spielman (2009). Cayley Graphs. Letcure Notes.
24. Luca Trevisan (2005). Approximation algorithms for Unique Games. In Proceedings of the IEEE Symposium on Foundations of Computer Science, volume 46, 197-205.