Faster Batched Shortest Paths in Road Networks

  title={Faster Batched Shortest Paths in Road Networks},
  author={Daniel Delling and Andrew V. Goldberg and Renato F. Werneck},
We study the problem of computing batched shortest paths in road networks efficiently. Our focus is on computing paths from a single source to multiple targets (one-to-many queries). We perform a comprehensive experimental comparison of several approaches, including new ones. We conclude that a new extension of PHAST (a recent one-to-all algorithm), called RPHAST, has the best performance in most cases, often by orders of magnitude. When used to compute distance tables (many-to-many queries… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
24 Citations
19 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.

Similar Papers

Loading similar papers…