Goal Directed Shortest Path Queries Using Precomputed Cluster Distances

DOI10.1007/11764298_29MaRDI QIDQ5307553zbMATH OpenOpenAlexFDO

Authors Jens Maue, Peter Sanders, Domagoj Matijević

Publication date 14 September 2007

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11764298_29

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Goal-directed shortest-path queries using precomputed cluster distances
• Engineering Highway Hierarchies
• Reach for A^*: shortest path algorithms with preprocessing
• Engineering highway hierarchies
• Geometric speed-up techniques for finding shortest paths in large sparse graphs

Cited in

(5)

• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Engineering Route Planning Algorithms
• Goal-directed shortest-path queries using precomputed cluster distances
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
• A novel pseudo‐polynomial approach for shortest path problems

Describes a project that uses

Uses Software

• METIS

This page was built for publication: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances

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