Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut.
Grant SchoenebeckLuca TrevisanMadhur TulsianiPublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- lp relaxation
- planar graphs
- linear programming
- linear program
- message passing
- optimal solution
- lower bound
- integer programming
- knapsack problem
- energy minimization
- feasible solution
- upper bound
- approximate inference
- integer program
- approximation algorithms
- valid inequalities
- maximum a posteriori
- belief propagation
- global constraints
- worst case
- binary variables
- np hard
- objective function
- minimum weight
- linear programming relaxation
- lagrangian relaxation
- primal dual
- energy function
- graphical models
- image segmentation
- special case
- dynamic programming
- genetic algorithm
- constraint satisfaction