A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
Grant SchoenebeckLuca TrevisanMadhur TulsianiPublished in: Computational Complexity Conference (2007)
Keyphrases
- lower bound
- vertex cover
- semidefinite
- approximation algorithms
- upper bound
- np hard
- semidefinite programming
- branch and bound algorithm
- worst case
- precedence constraints
- branch and bound
- optimal solution
- objective function
- lower and upper bounds
- partial order
- linear programming relaxation
- planar graphs
- upper and lower bounds
- linear programming
- primal dual
- log likelihood
- convex relaxation
- optimality criterion
- error bounds
- special case
- sufficient conditions