## Proving Integrality Gaps Without Knowing the Linear Program (2002)

### Cached

### Download Links

- [www.cs.princeton.edu]
- [toctest.cs.uchicago.edu]
- [www.theoryofcomputing.org]
- [tocmirror.cs.tau.ac.il]
- [theoryofcomputing.org]
- DBLP

### Other Repositories/Bibliography

by
Sanjeev Arora
,
Béla Bollobás
,
László Lovász

Venue: | Theory of Computing |

Citations: | 56 - 2 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

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