SHARC, fast and robust unidirectional routing

DOI10.1145/1498698.1537599MaRDI QIDQ5406205zbMATH OpenOpenAlexFDO

Authors Reinhard Bauer, Daniel Delling

Publication date 1 April 2014

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

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

zbMATH Keywords

Dijkstra's algorithmspeed-up technique

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) 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

(14)

• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
• Core routing on dynamic time-dependent road networks
• Bidirectional A^* search on time-dependent road networks
• Time-Dependent SHARC-Routing
• The Shortcut Problem – Complexity and Approximation
• Engineering Route Planning Algorithms
• Car or Public Transport—Two Worlds
• Real-time traffic assignment using engineered customizable contraction hierarchies
• Shortest-path queries in static networks
• SHARC: fast and robust unidirectional routing
• Time-dependent SHARC-routing
• Space-efficient, fast and exact routing in time-dependent road networks
• Reconfiguring shortest paths in graphs
• An exact combinatorial algorithm for minimum graph bisection

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 Q5406205)