Landmark-Based Routing in Dynamic Graphs
- 26 June 2007
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Speed-Up Techniques for Shortest-Path ComputationsPublished by Springer Nature ,2007
- In Transit to Constant Time Shortest-Path Queries in Road NetworksPublished by Society for Industrial & Applied Mathematics (SIAM) ,2007
- Reach for A*: Efficient Point-to-Point Shortest Path AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2006
- Geometric containers for efficient shortest-path computationACM Journal of Experimental Algorithmics, 2005
- A new approach to dynamic all pairs shortest pathsJournal of the ACM, 2004
- A fast algorithm for finding better routes by AI search techniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New dynamic algorithms for shortest path tree computationIEEE/ACM Transactions on Networking, 2000
- Shortest paths in euclidean graphsAlgorithmica, 1986
- The shortest route through a network with time-dependent internodal transit timesJournal of Mathematical Analysis and Applications, 1966
- A note on two problems in connexion with graphsNumerische Mathematik, 1959