Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 388-405

  Bhaskara, Aditya ^a   Charikar, Moses ^a   Guruswami, Venkatesan ^b   Vijayaraghavan, Aravindan ^a   Zhou, Yuan ^b  

^a Princeton University   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; EXPANSION; HARDNESS; POLYNOMIALS;

CONSTANT FACTORS; DENSEST K SUBGRAPH; INAPPROXIMABILITY; INTEGRALITY GAPS; POLYNOMIAL FACTOR; SEMIDEFINITE PROGRAMS; SMALL-SET EXPANSIONS; UPPER AND LOWER BOUNDS;

APPROXIMATION ALGORITHMS;

EID: 84860212454     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.34     Document Type: Conference Paper

References (38)

1. Sanjeev Arora, Boaz Barak, Markus Brunnermeier, and Rong Ge. Computational complexity and information asymmetry in financial products. In Proceedings of the First Symposium on Innovations in Computer Science (ICS), 2010. 2
2. Benny Applebaum, Boaz Barak, and Avi Wigderson. Public key cryptography from different assumptions. Preliminary version as cryptology eprint report 2008/335 by Barak and Wigderson, 2008. 2
3. Sanjeev Arora, Béla Bollobás, László Lovász, and Iannis Tourlakis. Proving Integrality Gaps without Knowing the Linear Program. Theory of Computing, vol. 2, pp. 19-51, 2006. 2
4. Sanjeev Arora, László Lovász, Han Newman, Yuval Rabani, Yuri Rabinovich, and Santosh Vempala. Local versus global properties of metric spaces. Proceedings of the 17th ACM-SIAM symposium on Discrete algorithms, pp. 41-50, 2006.
5. Noga Alon, Sanjeev Arora, Rajsekar Manokaran, Dana Moshkovitz, and Omri Weinstein. On the inapproximability of the densest k-subgraph problem. Manuscript, 2011. 2
6. 1/4) approximation for densest k-subgraph. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 201-210, New York, NY, USA, 2010. ACM. 1, 2, 3, 4, 5, 15
7. Boaz Barak, Prasad Raghavendra, David Steurer. Rounding Semidefinite Programming Hierarchies via Global Correlation. To appear in FOCS '11. 3, 4
8. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Local Global Tradeoffs in Metric Embeddings. Proceedings of the 48th Symposium on Foundations of Computer Science, pp. 713-723, 2007.
9. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Integrality gaps for Sherali-Adams relaxations. Proceedings of the 41st ACM Symposium on Theory of Computing, pp. 283-292, 2009. 2
10. Eden Chlamtac. Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations. Proceedings of the 47th Symposium on Foundations of Computer Science, pp. 691-701, 2006. 2, 4
11. Eden Chlamtac and Gyanit Singh. Improved Approximation Guarantees through Higher Levels of SDP Hierarchies. Proceedings of the 11th International Workshop, APPROX 2008, pp. 49-62. 2, 4
12. Eden Chlamtac and Madhur Tulsiani. Convex relaxations and integrality gaps. In To appear in Handbook on Semidefinite, Cone and Polynomial Optimization., http://www.cs.princeton.edu/chlamtac/sdpchapter.pdf, 2011. 2, 3, 4
13. Wenceslas Fernandez de la Vega and Claire Kenyon-Mathieu. Linear Programming Relaxations of Maxcut. Proceedings of the 18th Symposium on Discrete Algorithms, pp. 53-61, 2007. 2
14. Uriel Feige. Relations between average case complexity and approximation complexity. In Proceedings of the 34th annual ACM Symposium on Theory of Computing (STOC'02), pages 534-543. ACM Press, 2002. 1, 12
15. Uriel Feige, Guy Kortsarz, and David Peleg. The dense k-subgraph problem. Algorithmica, 29(3):410-421, 2001. 3, 5
16. Uriel Feige and Michael Seltser. On the densest Zc-subgraph problems. Technical Report CS97-16, Weizmann Institute of Science, Rehovot, Israel, 1997. 3, 4
17. Konstantinos Georgiou, Avner Magen, Toniann Pitassi, and Iannis Tourlakis. Integrality gaps of 2 - o(1) for vertex cover SDPs in the Lovász-Schrijver hierarchy. Proceedings of the 48th Symposium on Foundations of Computer Science, pp. 702-712, 2007. 2
18. Konstantinos Georgiou, Avner Magen, Madhur Tulsiani. Optimal Sherali-Adams Gaps from Pairwise Independence. Proceedings of APPROX 2009: 125-139 2
19. Venkatesan Guruswami, Ali Kemal Sinop. Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives. To appear in FOCS '11. 3, 4
20. Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou. Constant Factor Lasserre Gaps for Graph Partitioning Problems . Manuscript, 2011. 2
21. Wassily Hoeffding. Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association, Vol. 58, No. 301 (Mar., 1963), pp. 13-30. 13
22. Subhash Khot. Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS'02), pages 600-609, 2002. 2
23. Subhash Khot. Ruling out PTAS for graph minbisection, densest subgraph and bipartite clique. In Proceedings of the 44th Annual IEEE Symposium on the Foundations of Computer Science (FOCS'04), pages 136-145, 2004. 2
24. 1-embeddability. In Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS '09, pages 565-574, Washington, DC, USA, 2009. IEEE Computer Society. 2, 4
25. Jean B. Lasserre. Global Optimization with Polynomials and the Problem of Moments. SIAM J. Optim. vol. 11, no. 3, pp. 796-817, 2001. 2
26. Monique Laurent. A comparison of the Sherali-Adams, Lovász- Schrijver and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research, vol. 28, pp. 470-496, 2003. 2
27. László Lovász and Alexander Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim., vol. 1, pp. 166-190, 1991. 2
28. Prasad Raghavendra and David Steurer. Integrality gaps for strong sdp relaxations of unique games. In Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS '09, pages 575-585, Washington, DC, USA, 2009. IEEE Computer Society. 2, 4
29. Prasad Raghavendra and David Steurer. Graph expansion and the unique games conjecture. In STOC '10: Proceedings of the 42nd ACM symposium on Theory of computing, pages 755-764, New York, NY, USA, 2010. ACM. 2
30. Hanif D. Sherali and Warren P. Adams. A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems. SIAM J. Discrete Math.,, vol. 3, pp. 411-430, 1990. 2
31. Grant Schoenebeck. Linear Level Lasserre Lower Bounds for Certain k-CSPs. Proceedings of the 49th Symposium on Foundations of Computer Science, pp. 593-602, 2008. 2
32. Alex Samorodnitsky and Luca Trevisan. A PCP characterization of NP with optimal amortized query complexity. Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000. 2
33. Alex Samorodnitsky and Luca Trevisan. Cowers Uniformity, Influence of Variables, and PCPs. SIAM J.Comput. 39(1):323-360 (2006). 2
34. Grant Schoenebeck, Luca Trevisan, and Madhur Tulsiani. Tight Integrality Gaps for Lovász-Schrijver LP Relaxations of Vertex Cover and Max Cut. Proceedings of the 39th Symposium on Theory of Computing, pp. 302-310, 2007. 2
35. Grant Schoenebeck, Luca Trevisan, and Madhur Tulsiani. A Linear Round Lower Bound for Lovász-Schrijver SDP Relaxations of Vertex Cover. Proceedings of the 22nd Conference on Computational Complexity, pp. 205-216, 2007. 2
36. Anand Srivastav and Katja Wolf. Finding dense subgraphs with semidefinite programming. In Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pages 181-191, 1998. 3, 4
37. Madhur Tulsiani. CSP gaps and reductions in the lasserre hierarchy. In Proceedings of the 41st ACM symposium on Theory of computing, pages 303-312, 2009. 2, 8, 9
38. Konstantinos Georgiou, Avner Magen, and Madhur Tulsiani", Optimal Sherali-Adams Gaps from Pairwise Independence. In Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pages 125-139, 2009. 4