Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

Lovasz and Schrijver described a generic method of tightening the LP and SDP relaxation for any 0-1 optimization problem. These tightened relaxations were the basis of several celebrated approximation algorithms (such as for max-cu , max-3sat , and sparsest cut ).We prove strong inapproximability results in this model for well-known problems such as max-3sat , hypergraph vertex cover and set cover . We show that the relaxations produced by as many as Ω(n) rounds of the LS + procedure do not allow nontrivial approximation, thus ruling out the possibility that the LS + approach gives even slightly subexponential approximation algorithms for these problems.We also point out why our results are somewhat incomparable to known inapproximability results proved using PCPs, and formalize several interesting open questions.

[1]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

[2]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[3]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[4]  Michel X. Goemans,et al.  When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? , 2001, Math. Oper. Res..

[5]  Uriel Feige,et al.  Witnesses for non-satisfiability of dense random 3CNF formulas , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[6]  Madhur Tulsiani,et al.  A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[7]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.

[8]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[9]  Iannis Tourlakis.  Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy , 2005, APPROX-RANDOM.

[10]  Sanjeev Arora.  Proving Integrality Gaps without Knowing the Linear Program , 2003, FCT.

[11]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[12]  Michael Alekhnovich,et al.  Linear upper bounds for random walk on small density random 3-CNFs , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[13]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[14]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[15]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[16]  Béla Bollobás,et al.  Proving Integrality Gaps without Knowing the Linear Program , 2006, Theory Comput..

[17]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[18]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[19]  Madhur Tulsiani,et al.  Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut , 2007, STOC '07.

[20]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[21]  Wenceslas Fernandez de la Vega,et al.  Linear programming relaxations of maxcut , 2007, SODA '07.

[22]  Toniann Pitassi,et al.  Rank Bounds and Integrality Gaps for Cutting Planes Procedures , 2006, Theory Comput..

[23]  Uriel Feige.  A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[24]  Robert Krauthgamer,et al.  The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set , 2003, SIAM J. Comput..