Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

STOC
2009
ACM

favoriteEmaildiscussreport

98views Algorithms» more STOC 2009»

Sherali-adams relaxations of the matching polytope

14 years 11 months ago

Sherali-adams relaxations of the matching polytope

Download www.cs.brown.edu

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

Claire Mathieu, Alistair Sinclair

Real-time Traffic

Algorithms | Linear Programming Relaxations | Sherali-Adams Lift-and-project Hierarchy | STOC 2009 |

claim paper

Related Content

» On linear and semidefinite programming relaxations for hypergraph matching

» Lift and project relaxations for the matching and related polytopes

» Seeking a Vertex of the Planar Matching Polytope in NC

» Speeding up IPbased algorithms for constrained quadratic 01 optimization

Post Info
More Details (n/a)

Added	23 Nov 2009
Updated	23 Nov 2009
Type	Conference
Year	2009
Where	STOC
Authors	Claire Mathieu, Alistair Sinclair

Comments (0)