An Improved Bidirectional Heuristic Search Algorithm

DOI10.1145/322003.322004MaRDI QIDQ4128007zbMATH OpenOpenAlexWikidataFDO

Authors Dennis De Champeaux, Lenie Sint

Publication date 1977

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322003.322004

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cited in

(13)

• \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
• Computing shortest paths in networks derived from recurrence relations
• Bidirectional heuristic search with limited resources
• Perimeter search in restricted memory
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• Two new bidirectional search algorithms
• Heuristic shortest path algorithms for transportation applications: state of the art
• Symmetric connection problems and their solution by bidirectional search
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• Iterative Deepening Dynamically Improved Bounds Bidirectional Search
• Heuristically ordered search in state graphs
• Sublinear time shortest path in expander graphs

This page was built for publication: An Improved Bidirectional Heuristic Search Algorithm

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