Goal Directed Shortest Path Queries Using Precomputed Cluster Distances

DOI10.1007/11764298_29zbMath1196.68176OpenAlexW2982996625MaRDI QIDQ5307553

Jens Maue, Domagoj Matijević, Peter Sanders

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

Related Items (4)

A novel pseudo‐polynomial approach for shortest path problems ⋮ Engineering Route Planning Algorithms ⋮ Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks ⋮ Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

Uses Software

• METIS

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