Time-Dependent SHARC-Routing

DOI10.1007/978-3-540-87744-8_28zbMath1158.90311OpenAlexW2105824380MaRDI QIDQ3541096

Daniel Delling

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_28

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Scalable computational techniques for centrality metrics on temporally detailed social network ⋮ Time-dependent SHARC-routing ⋮ Engineering Route Planning Algorithms ⋮ Car or Public Transport—Two Worlds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The shortest route through a network with time-dependent internodal transit times
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Efficient models for timetable information in public transportation systems
• SHARC: Fast and Robust Unidirectional Routing