On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems.
Per AustrinRajsekar ManokaranCenny WennerPublished in: APPROX-RANDOM (2013)
Keyphrases
- constraint satisfaction problems
- np hardness
- np hard
- constraint satisfaction
- np complete
- approximation algorithms
- constraint programming
- ordering heuristics
- constraint propagation
- scheduling problem
- lower bound
- non binary
- arc consistency
- computational complexity
- partial order
- optimal solution
- combinatorial problems
- global constraints
- special case
- worst case
- linear programming
- constraint solving
- constraint problems
- search space
- constraint networks
- mixed integer
- linear program
- forward checking
- symmetry breaking
- binary constraints
- backtracking search
- solving constraint satisfaction problems