Computing Point-to-Point Shortest Paths from External Memory
@inproceedings{Goldberg2005ComputingPS,
title={Computing Point-to-Point Shortest Paths from External Memory},
author={A. Goldberg and Renato F. Werneck},
booktitle={ALENEX/ANALCO},
year={2005}
}We study the ALT algorithm [19] for the point-to-point shortest path problem in the context of road networks. We suggest improvements to the algorithm itself and to its preprocessing stage. We also develop a memory-efficient implementation of the algorithm that runs on a Pocket PC. It stores graph data in a flash memory card and uses RAM to store information only for the part of the graph visited by the current shortest path computation. The implementation works even on very large graphs… CONTINUE READING
Top 3 of 160 Citations
Performance Analysis of Parallel Speedup Techniques for Shortest Path Queries in Networks of Random and Planar Types
III: Small: Investigating Spatial Big Data for Next Generation Routing Services
Research on path planning algorithm and its application based on terrain slope for slipping prediction in complex terrain environment
Figures, Tables, and Topics from this paper.
160 Citations
Performance Analysis of Parallel Speedup Techniques for Shortest Path Queries in Networks of Random and Planar Types
- Computer Science
- 2012
Open Access
Research on path planning algorithm and its application based on terrain slope for slipping prediction in complex terrain environment
- Computer Science
- 2017
Optimisation et intégration de la mobilité partagée dans les systèmes de transport multimodaux. (Optimization and integration of shared mobility in multimodal transport systems)
- Computer Science, Engineering
- 2016
Open Access
References
Publications referenced by this paper.
SHOWING 1-10 OF 44 REFERENCES
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
- Computer Science
- 2003
145
Open Access
Undirected single-source shortest paths with positive integer weights in linear time
- Computer Science
- 1999
385
Open Access
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
- Computer Science
- 2004
22
Open Access
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
- Computer Science, Mathematics
- 2004
23
Open Access










