Sherali-adams relaxations of the matching polytope

We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for the integrality gap after k rounds of this hierarchy. The result is derived by a detailed analysis of

• Type: Conference
• Year: 2009
• Where: STOC
• Authors: Claire Mathieu, Alistair Sinclair
• Keywords: Algorithms, Linear Programming Relaxations, Sherali-Adams Lift-and-project Hierarchy, STOC 2009