Algorithms – ESA 2005
From MaRDI portal
Publication:5475866
DOI10.1007/11561071zbMath1162.68505MaRDI QIDQ5475866
Peter Sanders, Dominik Schultes
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
90B06: Transportation, logistics and supply chain management
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Shortest-path queries in static networks, Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps, Time-dependent SHARC-routing, Approximate shortest paths guided by a small index, A new bidirectional search algorithm with shortened postprocessing, A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing, Fast paths in large-scale dynamic road networks, Core Routing on Dynamic Time-Dependent Road Networks, User-Constrained Multimodal Route Planning, VC-Dimension and Shortest Path Algorithms, Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks, Bidirectional A ∗ Search for Time-Dependent Fast Paths, Engineering Route Planning Algorithms, Traffic Networks and Flows over Time, Car or Public Transport—Two Worlds