Proving integrality gaps without knowing the linear program

Authors

Sanjeev Arora, Princeton University
Béla Bollobás, Microsoft ResearchFollow
László Lovász, Microsoft Research

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.

Publication Title

Annual Symposium on Foundations of Computer Science - Proceedings

Recommended Citation

Arora, S., Bollobás, B., & Lovász, L. (2002). Proving integrality gaps without knowing the linear program. Annual Symposium on Foundations of Computer Science - Proceedings, 313-322. Retrieved from https://digitalcommons.memphis.edu/facpubs/5533