A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Sherali-adams relaxations of the matching polytope
2009
Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09
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 the LP after k rounds applied to the complete graph K 2d+1 . We give an explicit recurrence for the value of this LP, and hence show that its gap exhibits a "phase transition," dropping from close to its maximum value 1
doi:10.1145/1536414.1536456
dblp:conf/stoc/MathieuS09
fatcat:4qkzz7y6tbghpjxtobd42jxss4