Goal-directed shortest-path queries using precomputed cluster distances-Reference-Cited by-同舟云学术

Goal-directed shortest-path queries using precomputed cluster distances

Published:2009-12 Issue: Volume:14 Page:
ISSN:1084-6654
Container-title:ACM Journal of Experimental Algorithmics
language:en
Short-container-title:ACM J. Exp. Algorithmics

Author:

Maue Jens¹,Sanders Peter²,Matijevic Domagoj³

Affiliation:

1. Institute of Theoretical Computer Science, ETH Zürich, Switzerland

2. Fakultät für Informatik, Universität Karlsruhe (TH), Germany

3. Department of Mathematics, J.J. Strossmayer University, Osijek, Croatia

Abstract

We demonstrate how Dijkstra's algorithm for shortest path queries can be accelerated by using precomputed shortest path distances. Our approach allows a completely flexible tradeoff between query time and space consumption for precomputed distances. In particular, sublinear space is sufficient to give the search a strong “sense of direction”. We evaluate our approach experimentally using large, real-world road networks.

Funder

Deutsche Forschungsgemeinschaft

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/1498698.1564502

Reference29 articles.

1. Fast Routing in Road Networks with Transit Nodes

2. Delling D. Sanders P. Schultes D. and Wagner D. 2008. Engineering route planning algorithms. submitted for publication http://i11www.ira.uka.de/extra/publications/dssw-erpa-09.pdf. Delling D. Sanders P. Schultes D. and Wagner D. 2008. Engineering route planning algorithms. submitted for publication http://i11www.ira.uka.de/extra/publications/dssw-erpa-09.pdf.

3. A note on two problems in connexion with graphs

4. Fibonacci heaps and their uses in improved network optimization algorithms

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enactment analysis of classification method for voting in traffic prediction;AIP Conference Proceedings;2024

2. Efficient and Reconfigurable Optimal Planning in Large-Scale Systems Using Hierarchical Finite State Machines;2023 62nd IEEE Conference on Decision and Control (CDC);2023-12-13

3. Optimized Multicar Dynamic Route Planning Based on Time-Hierarchical Graph Model;IEEE Intelligent Transportation Systems Magazine;2023-11

4. A novel pseudo‐polynomial approach for shortest path problems;Networks;2021-02-16

5. Retracted: A novel pseudo‐polynomial approach for shortest paths problems;Networks;2020-07-14