An upper bound on the time complexity of iterative-deepening-\(A^*\)

DOI10.1007/BF01543478zbMath1034.68556OpenAlexW2088359154MaRDI QIDQ1354042

Mohammed Almulla, Brian G. Patrick, Monroe M. Newborn

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01543478

zbMATH Keywords

state space trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Related Items (5)

Linear-space best-first search ⋮ Iterative state-space reduction for flexible computation ⋮ Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ Performance of linear-space search algorithms ⋮ Performance of linear-space search algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic search algorithm with modifiable estimate
• Depth-first iterative-deepening: An optimal admissible tree search
• Probabilistic analysis of the complexity of A*
• Knowledge versus search: a quantitative analysis using A*
• On the complexity of admissible search algorithms
• On the optimality of A
• Heuristic search viewed as path finding in a graph
• Some Recent Results in Heuristic Search Theory
• Generalized best-first search strategies and the optimality of A*
• Three approaches to heuristic search in networks
• Search Algorithms Under Different Kinds of Heuristics—A Comparative Study

This page was built for publication: An upper bound on the time complexity of iterative-deepening-\(A^*\)