Algorithms – ESA 2005
From MaRDI portal
Publication:5475866
DOI10.1007/11561071zbMath1162.68505OpenAlexW2501059503MaRDI 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
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (22)
Uncertainties of sub-scaled supply and demand in agent-based mobility simulations with queuing traffic model ⋮ Mvtree for hierarchical network representation based on geometric algebra subspace ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ Bidirectional A ∗ Search for Time-Dependent Fast Paths ⋮ Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ VC-Dimension and Shortest Path Algorithms ⋮ Time-dependent SHARC-routing ⋮ Shortest-path queries in static networks ⋮ Approximate shortest paths guided by a small index ⋮ Fast paths in large-scale dynamic road networks ⋮ Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments ⋮ Core Routing on Dynamic Time-Dependent Road Networks ⋮ Engineering Route Planning Algorithms ⋮ Traffic Networks and Flows over Time ⋮ Energy-optimal routes for battery electric vehicles ⋮ A new bidirectional search algorithm with shortened postprocessing ⋮ User-Constrained Multimodal Route Planning ⋮ 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 ⋮ Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks ⋮ Unnamed Item
This page was built for publication: Algorithms – ESA 2005
