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