Geometric containers for efficient shortest-path computation

DOI10.1145/1064546.1103378zbMath1085.68736OpenAlexW2149964853MaRDI QIDQ5718630

Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis

Publication date: 16 January 2006

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

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

zbMATH Keywords

Dijkstra's algorithmshortest path routine

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (8)

Bidirectional A* search on time-dependent road networks ⋮ Unnamed Item ⋮ Engineering graph-based models for dynamic timetable information systems ⋮ Bidirectional A  ∗  Search for Time-Dependent Fast Paths ⋮ Shortest-path queries in static networks ⋮ Engineering Route Planning Algorithms ⋮ User-Constrained Multimodal Route Planning ⋮ Regarding Goal Bounding and Jump Point Search

Uses Software

• CGAL
• GraphML
• AspectC++

This page was built for publication: Geometric containers for efficient shortest-path computation