A new bidirectional search algorithm with shortened postprocessing
From MaRDI portal
Recommendations
- Two new bidirectional search algorithms
- Dynamically improved bounds bidirectional search
- scientific article; zbMATH DE number 1149449
- Note on ``A new bidirectional algorithm for shortest paths
- scientific article; zbMATH DE number 4166732
- scientific article; zbMATH DE number 1215043
- Bidirectional heuristic search with limited resources
- scientific article; zbMATH DE number 3982535
Cites work
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
- A note on two problems in connexion with graphs
- Algorithms – ESA 2005
- An Appraisal of Some Shortest-Path Algorithms
- Bidirectional Heuristic Search Again
- Computing the shortest path: A^ search meets graph theory
- Experimental and Efficient Algorithms
- Finding the Shortest Route between Two Points in a Network
- Heuristic estimates in shortest path algorithms
- Heuristic shortest path algorithms for transportation applications: state of the art
- scientific article; zbMATH DE number 1149449 (Why is no real title available?)
- scientific article; zbMATH DE number 3415384 (Why is no real title available?)
- On a routing problem
- On the complexity of admissible search algorithms
- The shortest path problem on large-scale real-road networks
Cited in
(6)- 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
- An exact bidirectional A^ approach for solving resource-constrained shortest path problems
- scientific article; zbMATH DE number 1149449 (Why is no real title available?)
- Note on ``A new bidirectional algorithm for shortest paths
This page was built for publication: A new bidirectional search algorithm with shortened postprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026755)
