Approximate Constraint Satisfaction Requires Large LP Relaxations.
Siu On ChanJames R. LeePrasad RaghavendraDavid SteurerPublished in: CoRR (2013)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- phase transition
- lp relaxation
- heuristic search
- constraint propagation
- linear programming
- constraint programming
- message passing
- combinatorial problems
- russian doll search
- constraint relaxation
- soft constraints
- arc consistency
- search space
- robust fault detection
- pairwise
- lower bound