SHARC: fast and robust unidirectional routing

DOI10.1137/1.9781611972887.2MaRDI QIDQ5233507zbMATH OpenOpenAlexFDO

Authors Reinhard Bauer, Daniel Delling

Publication date 11 September 2019

Published in 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

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

• SHARC, fast and robust unidirectional routing
• Time-Dependent SHARC-Routing
• Time-dependent SHARC-routing
• Time-dependent route planning
• Speed-Up Techniques for Shortest-Path Computations

Cited in

(6)

• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Time-Dependent SHARC-Routing
• A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels
• SHARC, fast and robust unidirectional routing
• Time-dependent SHARC-routing

This page was built for publication: SHARC: fast and robust unidirectional routing

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