Login / Signup
Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver Hierarchy.
Konstantinos Georgiou
Avner Magen
Toniann Pitassi
Iannis Tourlakis
Published in:
SIAM J. Comput. (2010)
Keyphrases
</>
vertex cover
approximation algorithms
partial order
planar graphs
np hard
mixed integer
precedence constraints
optimality criterion
special case
scheduling problem
single machine scheduling problem
polynomial time approximation
log likelihood