Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut.
Grant SchoenebeckLuca TrevisanMadhur TulsianiPublished in: STOC (2007)
Keyphrases
- lp relaxation
- planar graphs
- linear programming
- linear program
- message passing
- optimal solution
- lower bound
- knapsack problem
- integer programming
- upper bound
- energy minimization
- feasible solution
- approximation algorithms
- integer program
- worst case
- approximate inference
- np hard
- global constraints
- belief propagation
- valid inequalities
- maximum a posteriori
- binary variables
- column generation
- mixed integer
- cutting plane
- objective function