Proving integrality gaps without knowing the linear program


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

This document is currently not available here.