Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree.
Boaz BarakAnkur MoitraRyan O'DonnellPrasad RaghavendraOded RegevDavid SteurerLuca TrevisanAravindan VijayaraghavanDavid WitmerJohn WrightPublished in: APPROX-RANDOM (2015)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- random instances
- constraint propagation
- bounded degree
- np complete
- search space
- constraint programming
- non binary
- np hard
- constraint solving
- constraint networks
- combinatorial problems
- arc consistency
- binary csps
- solving constraint satisfaction problems
- graph theoretic
- sat problem
- constraint solver
- bounded treewidth
- partial constraint satisfaction
- forward checking
- pseudo boolean optimization
- finding optimal solutions
- partial assignment
- soft constraints
- satisfiability problem
- simulated annealing
- data model