Rounding semidefinite programming hierarchies via global correlation

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

Volumn , Issue , 2011, Pages 472-481

  Barak, Boaz ^a,b   Raghavendra, Prasad ^a,b   Steurer, David ^a,b  

^a MICROSOFT RESEARCH   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; ALPHABET SIZE; CONSTRAINT GRAPH; CONSTRAINT SATISFACTION PROBLEMS; EIGEN-VALUE; GLOBAL CORRELATION; HARD INSTANCES; INPUT GRAPHS; INTEGRAL SOLUTIONS; NON-TRIVIAL; ROUNDING ALGORITHM; SEMI-DEFINITE PROGRAMMING; SUB-EXPONENTIAL ALGORITHMS; UNIQUE GAMES; UNIQUE GAMES CONJECTURE;

COMPUTER SCIENCE; CONSTRAINT THEORY; MATHEMATICAL PROGRAMMING; POLYNOMIALS;

ALGORITHMS;

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

References (36)

1. N. Alon, A. Coja-Oghlan, H. Hàn, M. Kang, V. Rödl, and M. Schacht, "Quasi-randomness and algorithmic regularity for graphs with general degree distributions," SIAM J. Comput., vol. 39, no. 6, pp. 2336-2362, 2010.
2. S. Arora, B. Barak, and D. Steurer, "Subexponential algorithms for unique games and related problems," in FOCS, 2010, pp. 563-572.
3. S. Arora, B. Bollobás, L. Lovász, and I. Tourlakis, "Proving integrality gaps without knowing the linear program," Theory of Computing, vol. 2, no. 1, pp. 19-51, 2006.
4. S. Arora, S. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. K. Vishnoi, "Unique games on expanding constraint graphs are easy," in STOC, 2008, pp. 21-28.
5. S. Arora, S. Rao, and U. V. Vazirani, "Expander flows, geometric embeddings and graph partitioning," J. ACM, vol. 56, no. 2, 2009.
6. B. Barak, P. Gopalan, J. Hastad, R. Meka, P. Raghavendra, and D. Steurer, "Making the long code shorter, with applications to unique games conjecture," 2011, manuscript.
7. B. Barak, P. Raghavendra, and D. Steurer, "Rounding semidefinite programming hierarchies via global correlation," Electronic Colloquium on Computational Complexity (ECCC), vol. 18, p. 65, 2011.
8. A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan, "Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph," in STOC, 2010, pp. 201-210.
9. E. Chlamtac, "Approximation algorithms using hierarchies of semidefinite programming relaxations,"in FOCS, 2007, pp. 691-701.
10. E. Chlamtac and M. Tulsiani, "Convex relaxations and integrality gaps," 2010, chapter in Handbook on Semidefinite, Cone and Polynomial Optimization.
11. A. Coja-Oghlan, C. Cooper, and A. M. Frieze, "An efficient sparse regularity concept," SIAM J. Discrete Math., vol. 23, no. 4, pp. 2000-2034, 2010.
12. U. Feige and G. Schechtman, "On the optimality of the random hyperplane rounding technique for MAX CUT," Random Struct. Algorithms, vol. 20, no. 3, pp. 403-440, 2002. (Pubitemid 37340801)
13. A. M. Frieze and R. Kannan, "Quick approximation to matrices and applications," Combinatorica, vol. 19, no. 2, pp. 175-220, 1999.
14. 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, 2007, pp. 702-712.
15. M. X. Goemans and D. P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," J. ACM, vol. 42, no. 6, pp. 1115-1145, 1995.
16. V. Guruswami and A. K. Sinop, "Lasserre hierarchy, higher eigenvalues, and approximation schemes for quadratic integer programming with psd objectives," fOCS 2011.
17. A. Hassidim, J. A. Kelner, H. N. Nguyen, and K. Onak, "Local graph partitions for approximation and testing," in FOCS, 2009, pp. 22-31.
18. D. R. Karger, R. Motwani, and M. Sudan, "Approximate graph coloring by semidefinite programming," J. ACM, vol. 45, no. 2, pp. 246-265, 1998. (Pubitemid 128505780)
19. S. Khot, "On the power of unique 2-prover 1-round games," in STOC, 2002, pp. 767-775.
20. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell, "Optimal inapproximability results for Max-Cut and other 2-variable CSPs?" in FOCS, 2004, pp. 146-154.
21. S. Khot, P. Popat, and R. Saket, "Approximate lasserre integrality gap for unique games," in APPROX-RANDOM, 2010, pp. 298-311.
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 IEEE CCC, 2010, pp. 122-130.
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. J. B. Lasserre, "Global optimization with polynomials and the problem of moments," SIAM Journal on Optimization, vol. 11, no. 3, pp. 796-817, 2001.
27. M. Laurent, "A comparison of the sheraliadams, lovász- schrijver, and lasserre relaxations for 0-1 programming," Math. Oper. Res., vol. 28, no. 3, pp. 470-496, 2003.
28. L. Lovász and A. Schrijver, "Cones of matrices and set-functions and 0-1 optimization," SIAM J. Optim., vol. 1, no. 2, pp. 166-190, 1991.
29. E. Mossel, R. O'Donnell, and K. Oleszkiewicz, "Noise stability of functions with low influences invariance and optimality," in FOCS, 2005, pp. 21-30.
30. P. Raghavendra, "Optimal algorithms and inapproximability results for every CSP?" in STOC, 2008, pp. 245-254.
31. P. Raghavendra and D. Steurer, "Integrality gaps for strong SDP relaxations of unique games," in FOCS, 2009, pp. 575-585.
32. G. Schoenebeck, "Linear level Lasserre lower bounds for certain k-CSPs," in FOCS, 2008, pp. 593-602.
33. G. Schoenebeck, L. Trevisan, and M. Tulsiani, "A linear round lower bound for lovaszschrijver sdp relaxations of vertex cover," in IEEE CCC, 2007, pp. 205-216.
34. H. D. Sherali and W. P. Adams, "A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems," SIAM J. Discrete Math., vol. 3, no. 3, pp. 411-430, 1990.
35. D. Steurer, "Subexponential algorithms for dto- 1 two-prover games and for certifying almost perfect expansion," 2010, manuscript.
36. M. Tulsiani, "CSP gaps and reductions in the Lasserre hierarchy," in STOC, 2009, pp. 303-312.