Login / Signup
Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy.
Konstantinos Georgiou
Avner Magen
Toniann Pitassi
Iannis Tourlakis
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
vertex cover
approximation algorithms
worst case
partial order
lower bound
planar graphs
upper bound
optimality criterion
precedence constraints
np hard
special case
mixed integer
finding optimal
linear programming
error bounds
bayesian networks
linear programming relaxation
polynomial time approximation