Engineering Highway Hierarchies
From MaRDI portal
Publication:5449583
DOI10.1007/11841036_71zbMath1131.90324OpenAlexW1583434898MaRDI QIDQ5449583
Dominik Schultes, Peter Sanders
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11841036_71
Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
A novel pseudo‐polynomial approach for shortest path problems ⋮ Optimization of heuristic search using recursive algorithm selection and reinforcement learning ⋮ Processing time-dependent shortest path queries without pre-computed speed information on road networks ⋮ Aggregation of Markov flows I: theory ⋮ Time-dependent SHARC-routing ⋮ Shortest-path queries in static networks ⋮ Fast paths in large-scale dynamic road networks ⋮ The Shortcut Problem – Complexity and Approximation ⋮ Engineering Route Planning Algorithms ⋮ Car or Public Transport—Two Worlds ⋮ Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
This page was built for publication: Engineering Highway Hierarchies
