No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ

Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson

Abstract: The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [Khot S, Regev O (2008) Vertex cover might be hard to approximate t...