Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut

We study linear programming relaxations of Vertex Cover and Max Cut arising 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, Lovasz and Tourlakis prove that the integrality gap remains at least 2 - after (log n) rounds, where n is the number of vertices, and Tourlakis

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
• Keywords: Algorithms, Linear Programming Relaxations, STOC 2007, Vertex Cover