Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard.
Bernd S. W. SchröderPublished in: Artif. Intell. (2001)
Keyphrases
- np hard
- conflict directed backjumping
- constraint satisfaction problems
- forward checking
- conflict directed
- constraint satisfaction
- scheduling problem
- lower bound
- special case
- approximation algorithms
- arc consistency
- optimal solution
- linear programming
- branch and bound algorithm
- np complete
- minimum cost
- directed graph
- constraint propagation
- temporal logic
- constraint programming
- conflict resolution
- tree structure
- worst case
- search algorithm