Determining if (FC-) (conflict-directed) back jumping visits a given node is NP-hard

Authors:
Bernd S.W. Schröder
Affiliations:
Louisiana Tech. Univ., Ruston
Venue:
Artificial Intelligence
Year:
2001

Citing 6
Cited 0

Heuristic sampling: a method for predicting the performance of tree searching programs

SIAM Journal on Computing
Exploiting the deep structure of constraint problems

Artificial Intelligence
A theoretical evaluation of selected backtracking algorithms

Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Forward Checking Algorithm

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Conflict-directed backjumping revisited

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conflict-directed back jumping is a modification of the backtracking algorithm that can outperform forward checking in non-pathological examples. We prove it is in general NP-hard to determine if back jumping or conflict-directed back jumping or their forward checking hybrids visit a given node of a search space. This shows that these algorithms are fundamentally more complex to analyze than backtracking and forward checking. We conclude by describing how similar results can e proved for versions of the Maintaining Arc Consistency algorithm. 001 Elsevier Science B.V. All rights reserve.