Sciweavers

STOC
2009
ACM
98views Algorithms» more  STOC 2009»
15 years 4 days ago
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...
Claire Mathieu, Alistair Sinclair