High-performance multi-level routing

zbMATH Open1204.90110MaRDI QIDQ3574263FDOQ3574263

Authors: Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, Dorothea Wagner 

Publication date: 9 July 2010

Recommendations

• Engineering Highway Hierarchies
• Engineering highway hierarchies
• Algorithms – ESA 2005
• Partitioning graphs to speedup Dijkstra's algorithm
• Experimental and Efficient Algorithms

zbMATH Keywords

hierarchydecompositionshortest pathspreprocessinggraph compressionlevelsspeed-up techniquesupersedement

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) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38)

Cited In (7)

• Energy-optimal routes for battery electric vehicles
• Experimental and Efficient Algorithms
• Boosting the Exploration of Huge Dynamic Graphs
• Title not available (Why is that?)
• Levelwise mesh sparsification for shortest path queries
• Fission: Practical algorithms for computing minimum balanced node separators
• User-constrained multimodal route planning

This page was built for publication: High-performance multi-level routing

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