loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
San Diego, California
June 13-March 16
ISBN: 0-7695-2780-9
Grant Schoenebeck, UC Berkeley, USA
Luca Trevisan, UC Berkeley, USA
Madhur Tulsiani, UC Berkeley, USA
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ "lift-and-project" method of Lovasz and Schrijver starting from the standard linear programming relaxation.

Goemans and Kleinberg prove that after one round of LS+ the integrality gap remains arbitrarily close to 2. Charikar proves an integrality gap of 2, later strengthened by Hatami, Magen, and Markakis, for stronger relaxations that are, however, incomparable with two rounds of LS+. Subsequent work by Georgiou, Magen, Pitassi, and Tourlakis shows that the integrality gap remains 2 - \varepsilon after \Omega(\sqrt {\frac{{\log n}} {{\log \log n}}} ) rounds [?].

We prove that the integrality gap remains at least 7/6 - \varepsilon after c_{\varepsilon}n rounds, where n is the number of vertices and c_\varepsilon \ge 0 is a constant that depends only on \varepsilon.

Citation:
Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani, "A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover," ccc, pp.205-216, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.