Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems.
Peter JonssonAndrei A. KrokhinFredrik KuivinenPublished in: CSR (2007)
Keyphrases
- constraint satisfaction problems
- approximation schemes
- approximation algorithms
- np hard
- constraint satisfaction
- np complete
- special case
- graph coloring problems
- constraint programming
- tractable classes
- random instances
- search space
- constraint propagation
- combinatorial problems
- worst case
- arc consistency
- numerical methods
- computational problems
- computational complexity
- constraint problems
- constraint solving
- soft constraints
- constraint networks
- lower bound
- non binary
- bin packing
- randomly generated
- integer programming
- solving constraint satisfaction problems
- optimal solution
- partial constraint satisfaction
- sat problem
- global constraints
- reasoning problems
- polynomial size
- configuration problems
- backtracking search