Login / Signup
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy.
Konstantinos Georgiou
Avner Magen
Toniann Pitassi
Iannis Tourlakis
Published in:
FOCS (2007)
Keyphrases
</>
vertex cover
approximation algorithms
partial order
precedence constraints
planar graphs
mixed integer
polynomial time approximation
special case
np hard
branch and bound algorithm
log likelihood
optimality criterion