Lasserre hierarchy, higher eigenvalues, and approximation schemes for graph partitioning and quadratic integer programming with PSD objectives

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

Volumn , Issue , 2011, Pages 482-491

  Guruswami, Venkatesan ^a   Sinop, Ali Kemal ^a  

^a Carnegie Mellon University   (United States)

Author keywords

approximation algorithms; graph partitioning; semidefinite programming; unique games

Indexed keywords

APPROXIMATION RATIOS; APPROXIMATION SCHEME; APX-HARDNESS; EDGE EXPANSION; EIGENVALUES; FROBENIUS NORM; GRAPH BISECTION; GRAPH PARTITIONING; GRAPH PROBLEMS; HIGHER EIGENVALUES; INDEPENDENT SET; INTEGRALITY GAPS; LAPLACIANS; LINEAR CONSTRAINTS; LOW RANK APPROXIMATIONS; NORMALIZED GRAPH LAPLACIAN; NP-HARDNESS; OBJECTIVE FUNCTIONS; PLANAR GRAPH; QUADRATIC INTEGER PROGRAMMING; RUNNING-IN; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; SMALL-SET EXPANSIONS; SMALLEST EIGENVALUE; SPARSEST CUT; SPECTRAL PROPERTIES; UNIQUE GAMES;

COMPUTER SCIENCE; EIGENVALUES AND EIGENFUNCTIONS; EXPANSION; GRAPH THEORY; HARDNESS; INTEGER PROGRAMMING; LAPLACE TRANSFORMS;

APPROXIMATION ALGORITHMS;

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

References (33)

1. S. Khot, "Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique," SIAM J. Comput., vol. 36, no. 4, pp. 1025-1071, 2006. (Pubitemid 47246876)
2. C. Ambühl, M. Mastrolilli, and O. Svensson, "Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling," in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007, pp. 329-337.
3. U. Feige, "Relations between average case complexity and approximation complexity," in STOC, 2002, pp. 534-543.
4. P. Raghavendra, D. Steurer, and M. Tulsiani, "Reductions between expansion problems," Electronic Colloquium on Computational Complexity (ECCC), vol. 17, p. 172, 2010.
5. P. Raghavendra and D. Steurer, "Graph expansion and the unique games conjecture," in Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010, pp. 755-764.
6. J. A. Kelner, J. R. Lee, G. N. Price, and S.-H. Teng, "Metric uniformization and spectral bounds for graphs," CoRR, vol. abs/1008.3594, 2010,
7. prelim. version in FOCS'09.
8. J. K. Park and C. A. Phillips, "Finding minimum-quotient cuts in planar graphs," in STOC, 1993, pp. 766-775.
9. S. Arora, B. Barak, and D. Steurer, "Subexponential algorithms for Unique Games and related problems," in Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, 2010, pp. 563-572.
10. V. Guruswami, A. K. Sinop, and Y. Zhou, "Constant factor lasserre gaps for graph partitioning problems," Manuscript, July 2011.
11. V. Guruswami and A. K. Sinop, "Lasserre hierarchy, higher eigenvalues, and approximation schemes for quadratic integer programming with PSD objectives," arXiv:cs.DS/1104.4746, 2011.
12. J. Håstad, "Some optimal inapproximability results," Journal of the ACM, vol. 48, no. 4, pp. 798-859, 2001.
13. L. Trevisan, G. B. Sorkin, M. Sudan, and D. P. Williamson, "Gadgets, approximation, and linear programming," SIAM J. Comput., vol. 29, no. 6, pp. 2074-2097, 2000.
14. 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.
15. K. Makarychev and Y. Makarychev, "How to play unique games on expanders," in WAOA, ser. Lecture Notes in Computer Science, K. Jansen and R. Solis-Oba, Eds., vol. 6534. Springer, 2010, pp. 190-200.
16. 1," in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 53-62.
17. A. Kolla, "Spectral algorithms for Unique Games," in Proceedings of the 25th IEEE Conference on Computational Complexity, 2010, pp. 122-130.
18. J. B. Lasserre, "An explicit equivalent positive semidefinite program for nonlinear 0-1 programs," SIAM Journal on Optimization, vol. 12, no. 3, pp. 756-769, 2002.
19. A. Deshpande and S. Vempala, "Adaptive sampling and fast low-rank matrix approximation," in APPROX-RANDOM, 2006, pp. 292-303.
20. A. Deshpande and L. Rademacher, "Efficient volume sampling for row/column subset selection," in FOCS, 2010, pp. 329-338.
21. C. Boutsidis, P. Drineas, and M. Magdon-Ismail, "Nearoptimal column-based matrix reconstruction," CoRR, vol. abs/1103.0995, 2011.
22. V. Guruswami and A. K. Sinop, "Optimal column-based low-rank matrix reconstruction," arXiv:cs.DS/1104.1732, April 2011.
23. R. Oliveira, "The spectrum of random k-lifts of large graphs (with possibly large k)," Journal of Combinatorics, vol. 1, no. 3-4, pp. 285-306, 2010.
24. S. Khot, P. Popat, and R. Saket, "Approximate Lasserre integrality gap for unique games," in APPROX-RANDOM, 2010, pp. 298-311.
25. G. Schoenebeck, "Linear level Lasserre lower bounds for certain k-CSPs," in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 593-602.
26. M. Tulsiani, "CSP gaps and reductions in the Lasserre hierarchy,"in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 303-312.
27. S. Arora, S. Rao, and U. V. Vazirani, "Expander flows, geometric embeddings and graph partitioning," Journal of the ACM, vol. 56, no. 2, 2009.
28. E. Chlamtac, "Approximation algorithms using hierarchies of semidefinite programming relaxations," in 48th Annual IEEE Symposium on Foundations of Computer Science, 2007, pp. 691-701.
29. E. Chlamtac and G. Singh, "Improved approximation guarantees through higher levels of sdp hierarchies," in APPROXRANDOM, 2008, pp. 49-62.
30. A. R. Karlin, C. Mathieu, and C. T. Nguyen, "Integrality gaps of linear and semi-definite programming relaxations for knapsack," CoRR, vol. abs/1007.1283, 2010.
31. P. Raghavendra, "Optimal algorithms and inapproximability results for every CSP?" in Proceedings of the 40th ACM Symposium on Theory of Computing, 2008, pp. 245-254.
32. E. Chlamtac and M. Tulsiani, "Convex relaxations and integrality gaps," in Handbook on Semidefinite, Cone and Polynomial Optimization. Springer, 2011, to appear.
33. B. Barak, P. Raghavendra, and D. Steurer, "Rounding semidefinite programming hierarchies via global correlation,"arXiv:cs.DS/1104.4680, April 2011.