Corpus ID: 17849805

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}
}
  • A. Goldberg, Renato F. Werneck
  • Published in ALENEX/ANALCO 2005
  • Computer Science
  • 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
    PHAST: Hardware-Accelerated Shortest Path Trees
    • 114
    • Open Access
    Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
    • 270
    • Open Access
    Reach for A*: Shortest Path Algorithms with Preprocessing
    • 66
    • Open Access
    Efficient data management in support of shortest-path computation
    • 15
    • Highly Influenced
    • Open Access
    Better Landmarks Within Reach
    • 69
    • Open Access
    Optimizing Landmark-Based Routing and Preprocessing
    • 25
    • Highly Influenced
    • Open Access
    Shortest-path queries in static networks
    • 180
    • Open Access
    Point-to-Point Shortest Path Algorithms with Preprocessing
    • 45
    • 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
    • 145
    • Open Access
    An External Memory Data Structure for Shortest Path Queries
    • 52
    • Open Access
    Shortest path algorithms
    • 306
    Undirected single-source shortest paths with positive integer weights in linear time
    • 385
    • Open Access
    Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
    • 22
    • Open Access
    External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
    • 23
    • Open Access
    Shortest Path Algorithms: Engineering Aspects
    • 57
    • Open Access
    Computing the shortest path: A search meets graph theory
    • 769
    • Open Access
    An Appraisal of Some Shortest-Path Algorithms
    • 962
    A Simple Shortest Path Algorithm with Linear Average Time
    • 86