Sciweavers

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

11

WEA
2005
Springer

favoriteEmaildiscussreport

100views Algorithms» more WEA 2005»

Rounding to an Integral Program

13 years 9 months ago

Rounding to an Integral Program

Download www.math.tau.ac.il

We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as integer covering programs, possibly with additional side constraints. Second, the number of covering options is restricted in some sense, although this property may be well hidden. Our method is a natural extension of the threshold rounding technique.

Refael Hassin, Danny Segev

Real-time Traffic

Algorithms | Integer Covering Programs | NP-hard Problems | Underlying Properties | WEA 2005 |

claim paper

Related Content

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

» Messagepassing for Graphstructured Linear Programs Proximal Methods and Rounding Schemes

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

» Testing additive integrality gaps

» Approximate Lasserre Integrality Gap for Unique Games

» LiftandProject Integrality Gaps for the Traveling Salesperson Problem

» On linear and semidefinite programming relaxations for hypergraph matching

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

» Sheraliadams relaxations of the matching polytope

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WEA
Authors	Refael Hassin, Danny Segev

Comments (0)