Sciweavers

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

31

FCT
2003
Springer

favoriteEmaildiscussreport

112views Applied Computing» more FCT 2003»

Proving Integrality Gaps without Knowing the Linear Program

14 years 4 months ago

Proving Integrality Gaps without Knowing the Linear Program

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 approach. We prove an integrality gap of 2 − o(1) for three families of linear relaxations for VERTEX COVER, and our methods seem relevant to other problems as well.

Sanjeev Arora

Real-time Traffic

FCT 2003 | Integrality Gap | Linear Relaxations | NP Optimization Problems |

claim paper

Related Content

» Tight integrality gaps for LovaszSchrijver LP relaxations of vertex cover and max cut

» A Linear Round Lower Bound for LovaszSchrijver SDP Relaxations of Vertex Cover

» LiftandProject Integrality Gaps for the Traveling Salesperson Problem

» Strengthened 01 linear formulation for the daily satellite mission planning

» On linear and semidefinite programming relaxations for hypergraph matching

» An Analog Characterization of Elementarily Computable Functions over the Real Numbers

» Projection Lifting and Extended Formulation in Integer and Combinatorial Optimization

» Generalized Posynomial Performance Modeling

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	FCT
Authors	Sanjeev Arora

Comments (0)