Distance closures: unifying search- and lookup-based shortest path speedup techniques

DOI10.1137/1.9781611977042.1MaRDI QIDQ6543121zbMATH OpenFDO

Authors Daniel Bahrdt, Stefan Funke, Sokol Makolli

Publication date 24 May 2024

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

Mathematics Subject Classification ID

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

Recommendations

• Engineering highway hierarchies
• Algorithms – ESA 2005
• Engineering Highway Hierarchies
• Robust, almost constant time shortest-path queries in road networks
• Combining speed-up techniques for shortest-path computations

This page was built for publication: Distance closures: unifying search- and lookup-based shortest path speedup techniques

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