Search Sciweavers | Sciweavers

47 search results - page 2 / 10

» Integrality gaps for Sherali-Adams relaxations

click to vote

SODA
2010
ACM

216views Algorithms» more SODA 2010»

On linear and semidefinite programming relaxations for hypergraph matching

14 years 2 months ago

Download siam.org

The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...

Yuk Hei Chan, Lap Chi Lau

claim paper

Read More »

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 5 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 »

click to vote

FCT
2003
Springer

112views Applied Computing» more FCT 2003»

Proving Integrality Gaps without Knowing the Linear Program

13 years 10 months ago

Download www.cs.princeton.edu

: Proving integrality gaps for linear relaxations of NP optimization problems is a difﬁcult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...

Sanjeev Arora

claim paper

Read More »

click to vote

CORR
2010
Springer

142views Education» more CORR 2010»

Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack

13 years 5 months ago

Download www.cs.washington.edu

Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov

Anna R. Karlin, Claire Mathieu, C. Thach Nguyen

claim paper