Reach for A*: Efficient Point-to-Point Shortest Path Algorithms

DOI10.1137/1.9781611972863.13zbMath1428.68215OpenAlexW2151400766MaRDI QIDQ5233470

Haim Kaplan, Renato F. Werneck, Andrew V. Goldberg

Publication date: 11 September 2019

Published in: 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972863.13

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Traffic problems in operations research (90B20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels ⋮ Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter ⋮ Bidirectional A  ∗  Search for Time-Dependent Fast Paths ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ A parallel bio-inspired shortest path algorithm ⋮ Unnamed Item ⋮ Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments ⋮ Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks

This page was built for publication: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms