Approximating Constraint Satisfaction Problems on High-Dimensional Expanders.
Vedat Levi AlevFernando Granha JeronimoMadhur TulsianiPublished in: FOCS (2019)
Keyphrases
- constraint satisfaction problems
- high dimensional
- constraint satisfaction
- constraint programming
- constraint propagation
- search space
- non binary
- np complete
- np hard
- arc consistency
- constraint solving
- pseudo boolean optimization
- product configuration
- combinatorial problems
- computational problems
- decomposition methods
- temporal constraints
- backtracking search
- soft constraints
- disjunctive temporal
- partial constraint satisfaction
- backtracking algorithm
- finite domain
- constraint solver
- constraint optimization
- constraint problems
- solving constraint satisfaction problems
- symmetry breaking
- global constraints
- weighted constraint satisfaction
- orders of magnitude