New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy.
Iannis TourlakisPublished in: Computational Complexity Conference (2006)
Keyphrases
- vertex cover
- lower bound
- approximation algorithms
- np hard
- upper bound
- branch and bound algorithm
- precedence constraints
- planar graphs
- branch and bound
- partial order
- worst case
- lower and upper bounds
- upper and lower bounds
- optimality criterion
- objective function
- optimal solution
- lagrangian relaxation
- polynomial time approximation
- log likelihood
- finding optimal
- constant factor
- randomized algorithm
- maximum likelihood
- special case
- computational complexity