SHARC

DOI10.1145/1498698.1537599zbMath1284.05264OpenAlexW2009303970MaRDI QIDQ5406205

Daniel Delling, Reinhard Bauer

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

Network design and communication in computer systems (68M10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Bidirectional A* search on time-dependent road networks ⋮ Space-efficient, fast and exact routing in time-dependent road networks ⋮ Time-dependent SHARC-routing ⋮ Shortest-path queries in static networks ⋮ The Shortcut Problem – Complexity and Approximation ⋮ Core Routing on Dynamic Time-Dependent Road Networks ⋮ An exact combinatorial algorithm for minimum graph bisection ⋮ Engineering Route Planning Algorithms ⋮ Car or Public Transport—Two Worlds ⋮ Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

This page was built for publication: SHARC