How to play unique games against a semi-random adversary: Study of semi-random models of unique games

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

Volumn , Issue , 2011, Pages 443-452

  Kolla, Alexandra ^a   Makarychev, Konstantin ^b   Makarychev, Yury ^c  

^a MICROSOFT RESEARCH   (United States)

^b IBM RESEARCH   (United States)

^c TTIC ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE DEGREE; AVERAGE-CASE COMPLEXITY; ONE STEP; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SEMI-RANDOM; UNIQUE GAMES;

ALGORITHMS; COMPUTER SCIENCE;

POLYNOMIALS;

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

References (27)

1. M. Alekhnovich. More on Average Case vs Approximation Complexity. Proceedings of the 44st IEEE Symposium on Foundations of Computer Science: pp, 298-307, 2003.
2. G. Andersson, L. Engebretsen, and J. Håstad. A new way to use semidefinite programming with applications to linear equations mod p. Journal of Algorithms, Vol. 39, 2001, pp. 162-204. (Pubitemid 33668348)
3. S. Arora, B. Barak, and D. Steurer. Subexponential Algorithms for Unique Games and Related problems. Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, 2010.
4. S. Arora, R. Impagliazzo, W. Matthews, and D. Steurer. Improved algorithms for unique games via divide and conquer. ECCC Report TR10-041, 2010.
5. S. Arora, S. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. Vishnoi. Unique games on expanding constraint graphs are easy. Proceedings of the 40th ACM Symposium on Theory of Computing, pp. 21-28, 2008.
6. B. Barak, M. Hardt, I. Haviv, A. Rao, O. Regev and D. Steurer. Rounding Parallel Repetitions of Unique Games, Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 374-383, 2008.
7. A. Blum and J. Spencer. Coloring Random and Semi-Random k-Colorable Graphs. J. Algorithms, vol. 19, no. 2, pp. 204-234, 1995.
8. M. Charikar, K. Makarychev, and Y. Makarychev. Near-Optimal Algorithms for Unique Games. Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 205-214, 2006.
9. E. Chlamtac, K. Makarychev, and Y. Makarychev. How to Play Unique Games Using Embeddings. Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, pp. 687-696, 2006.
10. A. Gupta and K. Talwar. Approximating Unique Games. Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 99-106, 2006.
11. U. Feige. Relations Between Average Case Complexity and Approximation Complexity. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 534-543, 2002.
12. U. Feige and J. Kilian. Heuristics for Semirandom Graph Problems. Journal of Computing and System Sciences, vol. 63, pp. 639-671, 2001. (Pubitemid 34325774)
13. U. Feige and R. Krauthgamer. Finding and Certifying a Large Hidden Clique in a Semi-Random Graph. Random Structures and Algorithms, vol. 16(2), pp. 195-208, 2000.
14. V. Guruswami, R. Manokaran, and P. Raghavendra. Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 573-582, 2008.
15. V. Guruswami and P. Raghavendra. Constraint satisfaction over a non-boolean domain: Approximation algorithms and unique-games hardness. Proceedings of APPROX-RANDOM, 77-90, 2008.
16. M. Jerrum. Large Cliques Elude the Metropolis Process. Random Structures and Algorithm, vol. 3 (4), pp. 347-359, 1992.
17. S. Khot. On the power of unique 2-prover 1-round games. Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 767-775, 2002.
18. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM Journal on Computing, vol. 37(1), pp. 319-357, 2007. (Pubitemid 351321999)
19. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2 - ε. Proceedings of the 18th IEEE Annual Conference on Computational Complexity, 2003.
20. 1. Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 53-62, 2005.
21. A. Kolla. Spectral Algorithms for Unique Games Proceedings of the Conference on Computational Complexity, pp. 122-130, 2010.
22. A. Kolla, K. Makarychev, Y. Makarychev. How to Play Unique Games against a Semi-Random Adversary. Preprint. ArXiv:1104.3806v1 [cs.DS].
23. K. Makarychev and Y. Makarycev. How to Play Unique Games on Expanders. WAOA 2010. Lecture Notes in Computer Science, vol. 6534/2011, pp. 190-200, 2011.
24. P. Raghavendra. Optimal algorithms and inapproximability results for every CSP? Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 245-254, 2008.
25. P. Raghavendra and D. Steurer, How to Round Any CSP. Proceedings of the 50th IEEE Symposium on Foundations of Computer Science, pp. 586-594, 2009.
26. A. Samorodnitsky and L. Trevisan. Gowers uniformity, influence of variables, and PCPs. Proceedings of the 38th annual ACM Symposium on Theory of Computing, pp. 11-20, 2006.
27. L. Trevisan. Approximation Algorithms for Unique Games. Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pp. 197-205, 2005.