SDP gaps and UGC-hardness for MAXCUTGAIN

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

Volumn , Issue , 2006, Pages 217-226

  Khot, Subhash ^a   O'Donneil, Ryan ^b  

^a Georgia Tech

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN SPACE; GOEMANS-WILLIAMSON [GW95]; LINEAR ROUNDING FUNCTIONS; SEMIDEFINITE PROGRAMMING (SDP);

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; OPTIMIZATION;

GRAPH THEORY;

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

References (37)

1. S. Arora, E. Berger, E. Hazan, G. Kindler, S. Safra. On non-approximability for quadratic programs. FOCS 2005, 206-215.
2. A. Agarwal, M. Charikar, K. Makarychev, Y. Makarychev. O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems. STOC 2005.
3. N. Alon, K. Makarychev, Y. Makarychev, A. Naor. Quadratic forms on graphs. Inventions Mathematicae 163(3), 499-522, 2006.
4. N. Alon, A. Naor. Approximating the Cut-Norm via Grothendieck's Inequality. SIAM J. of Computing 35(4), 787-803, 2006.
5. S. Arora, S. Rao, U. Vazirani. Expander flows, geometric embeddings, and graph partitioning. STOC 2004, 222-231.
6. N. Bansal, A. Blum, S. Chawla. Correlation clustering. Machine Learning 56(1-3), 89-113, 2004.
7. M. Bellare, O. Goldreich, M. Sudan. Free bits, PCPs and non-approximability - to-wards tight results. SIAM J. of Computing 27, 804-915, 1998.
8. C. Borell. Geometric bounds on the Omstein-Uhlenbeck velocity process. Z. Wahrsch. Verw. Gebeite 70(1), 1-13, 1985.
9. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. To appear, Computational Complexity.
10. M. Charikar, K. Makarychev, Y. Makarychev. Near-optimal algorithms for Unique Games. STOC 2006.
11. P. Crescenzi, R. Silvestri, L. Trevisan. On weighted vs unweighted versions of combinatorial optimization problems. Information and Computation 167(1), 10-26, 2001.
12. M. Charikar, A. Wirth. Maximizing quadratic programs: extending Grothendieck's Inequality. FOCS 2004, 54-60.
13. I. Dinur, E. Mossel, O. Regev. Conditional hardness of approximate coloring. To appear, STOC 2006.
14. 2 rounding technique for semideflnite programs. ICALP 2001, 213-224.
15. U. Feige, D. Reichman. On systems of linear equations with two variables per equation. APPROX-RANDOM 2004, 117-127.
16. U. Feige, G. Schechtman. On the integrality ratio of semidefinite relaxations of MAX CUT. STOC 2001, 433-442.
17. B. Green. A Szemerédi-type regularity lemma in abelian groups. GAFA 15(2), 340-376, 2005.
18. A. Grothendieck. Résumé de la théorie métrique des produits tensoriels topologiques. Bol. Soc. Mat. Sao Pauo 8, 1-79, 1953.
19. M. Goemans, D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM 42, 1115-11145, 1995.
20. J. Håstad. Some optimal inapproximability results. JACM 48 ,798-869, 2001.
21. J. Håstad, S. Venkatesh. On the advantage over a random assignment. RSA 25(2), 117-149, 2004.
22. G. Karakostas. A better approximation ratio for the Vertex Cover problem. ICALP 2005, 1043-1050.
23. S. Khot. On the power of unique 2-prover 1-round games. STOC 2002, 767-775.
24. S. Khot, G. Kindler, E. Mossel, R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? FOCS 2004. To appear in SIAM J. of Computing.
25. S. Khot, A. Naor. Nonembeddability theorems via Fourier analysis. Mathematische Annalen 334(4), 821-852, 2005.
26. S. Khot, O. Regev. Vertex Cover might be hard to approximate to within 2 - ε. CCC 2003, 379-386.
27. 1. SODA 2006.
28. 1 FOCS 2005, 216-225.
29. J. Krivine. Sur la constante de Grothendieck. C. R. Acad. Sci. Paris Ser. A-B 284 (1977), 445-446.
30. M. Ledoux, M. Talagrand. Probability in Banach Spaces. Springer, 1991.
31. A. Megretski. Relaxation of quadratic programs in operator theory and system analysis. In Systems, Approximation, Singular Integral Operators, and Related Topics, Birkhauser 2001, 365-392.
32. E. Mossel, R. O'Donnell, K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. FOCS 2005, 21-30.
33. Y. Nesterov. Global quadratic optimization via conic relaxation. Technical report, CORE, Universite Catholique de Louvain, 1998.
34. A. Nemirovski, C. Roos, T. Terlaky. On maximization of quadratic forms over intersections of ellipsoids with common center. Mathematical Programming 86(3) (1999), 463-473.
35. J. Reeds. A new lower bound on the real Grothendieck constant. Unpublished manuscript, 1993. Available at http://www.dtc.umn.edu/~reedsj
36. L. Trevisan, G. Sorkin, M. Sudan, D. Williamson. Gadgets, approximation, and linear programming. SICOMP 29(6), 2074-2097, 2000.
37. U. Zwick. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. STOC 1999, 679-687.