A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
Grant SchoenebeckLuca TrevisanMadhur TulsianiPublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- lower bound
- vertex cover
- semidefinite
- approximation algorithms
- upper bound
- branch and bound algorithm
- np hard
- semidefinite programming
- precedence constraints
- worst case
- branch and bound
- partial order
- lower and upper bounds
- upper and lower bounds
- linear programming
- planar graphs
- objective function
- convex sets
- lagrangian relaxation
- convex relaxation
- optimal solution
- bayesian networks
- minimum cost
- linear programming relaxation
- optimality criterion
- polynomial time approximation