ABSTRACT
We prove strong lower bounds on integrality gaps of Sherali-Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali-Adams relaxations that survive nδ rounds of lift and project. For MAX CUT and Vertex Cover, these show that even nδ rounds of Sherali-Adams do not yield a better than 2-ε approximation. The main combinatorial challenge in constructing these gap examples is the construction of a fractional solution that is far from an integer solution, but yet admits consistent distributions of local solutions for all small subsets of variables. Satisfying this consistency requirement is one of the major hurdles to constructing Sherali-Adams gap examples. We present a modular recipe for achieving this, building on previous work on metrics with a local-global structure. We develop a conceptually simple geometric approach to constructing Sherali-Adams gap examples via constructions of consistent local SDP solutions. This geometric approach is surprisingly versatile. We construct Sherali-Adams gap examples for Unique Games based on our construction for MAX CUT together with a parallel repetition like procedure. This in turn allows us to obtain Sherali-Adams gap examples for any problem that has a Unique Games based hardness result (with some additional conditions on the reduction from Unique Games). Using this, we construct 2-ε gap examples for Maximum Acyclic Subgraph that rules out any family of linear constraints with support at most nδ.
- S. Arora, B. Bollobás, L. Lovász, and I. Tourlakis. Proving Integrality Gaps without Knowing the Linear Program. Theory of Computing, vol. 2, pp. 19--51, 2006.Google ScholarCross Ref
- S. Arora, L. Lovász, I. Newman, Y. Rabani, Y. Rabinovich, and S. Vempala. Local versus global properties of metric spaces. Proceedings of the 17th Symposium on Discrete Algorithms, pp. 41--50, 2006. Google ScholarDigital Library
- M. Charikar, K. Makarychev, and Y. Makarychev. Local Global Tradeoffs in Metric Embeddings. ECCC Technical Report. Proceedings of the 48th Symposium on Foundations of Computer Science, pp. 713--723, 2007. Google ScholarDigital Library
- Eden Chlamtac. Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations. Proceedings of the 47th Symposium on Foundations of Computer Science, pp. 691--701, 2006. Google ScholarDigital Library
- E. Chlamtac and G. Singh. Improved Approximation Guarantees through Higher Levels of SDP Hierarchies. Proceedings of the 11th International Workshop, APPROX 2008, pp. 49--62. Google ScholarDigital Library
- W. F. de la Vega and C. Kenyon-Mathieu. Linear Programming Relaxations of Maxcut. Proceedings of the 18th Symposium on Discrete Algorithms, pp. 53--61, 2007. Google ScholarDigital Library
- 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. Proceedings of the 48th Symposium on Foundations of Computer Science, pp. 702--712, 2007. Google ScholarDigital Library
- M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semi definite programming. Journal of the ACM, vol. 42, no. 6, pp. 1115--1145, Nov. 1995. Google ScholarDigital Library
- . Grötschel, M. Jünger, and G. Reinelt, A cutting plane algorithm for the linear ordering problem. Operations Research 32 (1984), pp. 1195--1220.Google ScholarDigital Library
- . Grötschel, M. Jünger, and G. Reinelt, On the acyclic subgraph polytope. Mathematical Programming, 32 (1985), pp. 28--42.Google Scholar
- . Grötschel, M. Jünger, and G. Reinelt, Facets of the linear ordering polytope. Mathematical Programming, 32 (1985), pp. 43--60.Google Scholar
- V. Guruswami, R. Manokaran, and P. Raghavendra. Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. Proceedings of the 49th Symposium on Foundations of Computer Science, pp. 573--582, 2008. Google ScholarDigital Library
- J. B. Lasserre. Global Optimization with Polynomials and the Problem of Moments. SIAM J. Optim. vol. 11, no. 3, pp. 796--817, 2001. Google ScholarDigital Library
- M. Laurent. A comparison of the Sherali---Adams, Lovász-Schrijverand Lasserre relaxations for 0-1 programming. Mathematics of Operations Research, vol. 28, pp. 470--496, 2003. Google ScholarDigital Library
- L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization, vol. 1, pp. 166--190, 1991. SIAM J. Optim., vol. 1, pp. 166--190, 1991.Google ScholarCross Ref
- 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, pp. 411--430, 1990. Google ScholarDigital Library
- G. Schoenebeck. Linear Level Lasserre Lower Bounds for Certain k-CSPs. Proceedings of the 49th Symposium on Foundations of Computer Science, pp. 593---602, 2008. Google ScholarDigital Library
- G. Schoenebeck, L. Trevisan, and M. 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. Google ScholarDigital Library
- G. Schoenebeck, L. Trevisan, and M. 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. Google ScholarDigital Library
- I. Tourlakis. New lower bounds for Approximation Algorithms in the Lovász-Schrijver Hierarchy. Ph.D. Thesis, Princeton University, 2006. Google ScholarDigital Library
Index Terms
- Integrality gaps for Sherali-Adams relaxations
Recommendations
Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer scienceWe consider approximation schemes for the maximum constraint satisfaction problems and the maximum assignment problems. Though they are NP-Hard in general, if the instance is "dense" or "locally dense", then they are known to have approximation schemes ...
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computingWe study linear programming relaxations of Vertex Cover and Max Cutarising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting from the standard linear programming relaxation.
For Vertex Cover, Arora, Bollobas, ...
Comments