On the complexity of admissible search algorithms

DOI10.1016/0004-3702(77)90002-9MaRDI QIDQ1232903zbMATH OpenOpenAlexFDO

Authors Alberto Martelli

Publication date 1977

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(77)90002-9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3474975 (Why is no real title available?)
• scientific article; zbMATH DE number 3454407 (Why is no real title available?)
• scientific article; zbMATH DE number 3351222 (Why is no real title available?)
• scientific article; zbMATH DE number 3351223 (Why is no real title available?)
• A Note on Dijkstra's Shortest Path Algorithm
• Branch-and-Bound Methods: A Survey
• Heuristic search viewed as path finding in a graph
• The heuristic search under conditions of error

Cited in

(20)

• Heuristic search for one-to-many shortest path queries
• Remarks on the \(\mathrm A^{\ast\ast}\) algorithm
• Knowledge versus search: a quantitative analysis using A*
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• An upper bound on the time complexity of iterative-deepening-\(A^*\)
• Heuristic tree search with nonparametric statistical inference methods
• scientific article; zbMATH DE number 4131689 (Why is no real title available?)
• Boosting optimal symbolic planning: operator-potential heuristics
• A new bidirectional search algorithm with shortened postprocessing
• Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
• A heuristic search algorithm with modifiable estimate
• Heuristically ordered search in state graphs
• Heuristic estimates in shortest path algorithms
• Probabilistic analysis of the complexity of A*
• Heuristic search strategies for multiobjective state space search
• A result on the computational complexity of heuristic estimates for the A^* algorithm
• A method for computing heuristics in problem solving
• Inconsistent heuristics in theory and practice
• A new variant of the \(A^*\)-algorithm which closes a node at most once.
• Utility of pathmax in partial order heuristic search

This page was built for publication: On the complexity of admissible search algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1232903)