Engineering Fast Route Planning Algorithms
- 26 June 2007
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Landmark-Based Routing in Dynamic GraphsPublished by Springer Nature ,2007
- Fast Routing in Road Networks with Transit NodesScience, 2007
- In Transit to Constant Time Shortest-Path Queries in Road NetworksPublished by Society for Industrial & Applied Mathematics (SIAM) ,2007
- Computing Many-to-Many Shortest Paths Using Highway HierarchiesPublished by Society for Industrial & Applied Mathematics (SIAM) ,2007
- Better Landmarks Within ReachLecture Notes in Computer Science, 2007
- Engineering Multi-Level Overlay Graphs for Shortest-Path QueriesPublished by Society for Industrial & Applied Mathematics (SIAM) ,2006
- Reach for A*: Efficient Point-to-Point Shortest Path AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2006
- Highway Hierarchies Hasten Exact Shortest Path QueriesLecture Notes in Computer Science, 2005
- Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse GraphsLecture Notes in Computer Science, 2003
- A note on two problems in connexion with graphsNumerische Mathematik, 1959