Approximating CSPs using LP Relaxation.
Subhash KhotRishi SaketPublished in: Electron. Colloquium Comput. Complex. (2016)
Keyphrases
- lp relaxation
- linear programming
- constraint satisfaction problems
- linear program
- message passing
- global constraints
- optimal solution
- feasible solution
- integer programming
- knapsack problem
- energy minimization
- constraint satisfaction
- arc consistency
- constraint propagation
- integer program
- np hard
- search space
- constraint programming
- min cut
- subtour elimination
- dynamic programming
- energy function
- valid inequalities
- image segmentation
- maximum a posteriori
- belief propagation
- np complete
- graph cuts
- primal dual
- distributed systems
- pairwise