Proving Integrality Gaps Without Knowing the Linear Program (2002)
Cached
Download Links
- [www.cs.princeton.edu]
- [theoryofcomputing.org]
- DBLP
Other Repositories/Bibliography
by
Sanjeev Arora
,
Béla Bollobás
,
László Lovász
| Venue: | Theory of Computing |
| Citations: | 47 - 3 self |
BibTeX
@INPROCEEDINGS{Arora02provingintegrality,
author = {Sanjeev Arora and Béla Bollobás and László Lovász},
title = {Proving Integrality Gaps Without Knowing the Linear Program},
booktitle = {Theory of Computing},
year = {2002},
pages = {313--322}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Proving integrality gaps for linear relaxations of NP optimization problems is a difficult 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.
