linear programming relaxations

38

SIAMJO
2000

116views more SIAMJO 2000»

Computational Experience with an Interior Point Cutting Plane Algorithm

13 years 10 months ago

There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...

John E. Mitchell

claim paper

Read More »

29

click to vote

APPROX
2010
Springer

189views Algorithms» more APPROX 2010»

Approximating Sparsest Cut in Graphs of Bounded Treewidth

13 years 11 months ago

Download www.wisdom.weizmann.ac.il

We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...

Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...

claim paper

Read More »

37

click to vote

STOC
2007
ACM

117views Algorithms» more STOC 2007»

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

14 years 11 months ago

Download eccc.hpi-web.de

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 ...

Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani

claim paper

Read More »

25

click to vote

STOC
2009
ACM

98views Algorithms» more STOC 2009»

Sherali-adams relaxations of the matching polytope

14 years 11 months ago

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...

Claire Mathieu, Alistair Sinclair

claim paper

Read More »

25

click to vote

ICML
2009
IEEE

129views Machine Learning» more ICML 2009»

Solution stability in linear programming relaxations: graph partitioning and unsupervised learning

14 years 11 months ago