scientific article; zbMATH DE number 5734725

zbMATH Open1195.90021MaRDI QIDQ3574265FDOQ3574265

Authors: Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner 

Publication date: 9 July 2010

Title of this publication is not available (Why is that?)

Recommendations

• Engineering Highway Hierarchies
• Engineering highway hierarchies
• Interconnecting Highways
• Adaptive highways on a grid
• CONSTRUCTING OPTIMAL HIGHWAYS
• Congestion on Multilane Highways

zbMATH Keywords

graphhierarchyshortest pathsroad networkroutingpreprocessingspeed-up techniquegoal-direction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Traffic problems in operations research (90B20)

Cited In (15)

• Engineering highway hierarchies
• Algorithms – ESA 2005
• Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
• Engineering Route Planning Algorithms
• More hierarchy in route planning using edge hierarchies
• Time-dependent SHARC-routing
• Shortest-path queries in static networks
• A multilevel fast marching method for the minimum time problem
• Highway dimension, shortest paths, and provably efficient algorithms
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Core routing on dynamic time-dependent road networks
• Time-Dependent SHARC-Routing
• Engineering Highway Hierarchies
• Title not available (Why is that?)
• Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574265)