Abstract
Thorup recently showed that single-source shortest-paths problems in undirected networks with n vertices, m edges, and edge weights drawn from 0,..., 2w - 1 can be solved in O(n + m) time and space on a unit-cost random-access machine with a word length of w bits. His algorithm works by traversing a so-called component tree. Two new related results are provided here. First, and most importantly, Thorup’s approach is generalized from undirected to directed networks. The resulting time bound, O(n + m log w), is the best deterministic linear-space bound known for sparse networks unless w is superpolynomial in log n. As an application, all-pairs shortest-paths problems in directed networks with n vertices, m edges, and edge weights in -2w,..., 2w can be solved in O(nm + n 2 log log n) time and O(n + m) space (not counting the output space). Second, it is shown that the component tree for an undirected network can be constructed in deterministic linear time and space with a simple algorithm, to be contrasted with a complicated and impractical solution suggested by Thorup. Another contribution of the present paper is a greatly simplified view of the principles underlying algorithms based on component trees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, Faster algorithms for the shortest path problem, J. ACM 37 (1990), pp. 213–223.
R. Bellman, On a routing problem, Quart. Appl. Math. 16 (1958), pp. 87–90.
B. V. Cherkassky, A. V. Goldberg, and C. Silverstein, Buckets, heaps, lists, and monotone priority queues, SIAM J. Comput. 28 (1999), pp. 1326–1346.
G. B. Dantzig, On the shortest route through a network, Management Sci. 6 (1960), pp. 187–190.
E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959), pp. 269–271.
L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34 (1987), pp. 596–615.
M. L. Fredman and D. E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. System Sci. 48 (1994), pp. 533–551.
H. N. Gabow, A scaling algorithm for weighted matching on general graphs, in Proc. 26th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1985), pp. 90–100.
T. Hagerup, Sorting and searching on the word RAM, in Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science, Vol. 1373, Springer, Berlin, pp. 366–398.
D. B. Johnson, Efficient algorithms for shortest paths in sparse networks, J. ACM 24 (1977), pp. 1–13.
R. C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36 (1957), pp. 1389–1401.
R. Raman, Priority queues: Small, monotone and trans-dichotomous, in Proc. 4th Annual European Symposium on Algorithms (ESA 1996), Lecture Notes in Computer Science, Vol. 1136, Springer, Berlin, pp. 121–137.
R. Raman, Recent results on the single-source shortest paths problem, SIGACT News 28:2 (1997), pp. 81–87.
R. Raman, Priority queue reductions for the shortest-path problem, in Proc. 10th Australasian Workshop on Combinatorial Algorithms (AWOCA 1999), Curtin University Press, pp. 44–53.
R. E. Tarjan, Efficiency of a good but not linear set union algorithm, J. ACM 22, (1975), pp. 215–225.
M. Thorup, On RAM priority queues, in Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), pp. 59–67.
M. Thorup, Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations, in Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 352–359.
M. Thorup, Faster deterministic sorting and priority queues in linear space, Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 550–555.
M. Thorup, Undirected single-source shortest paths with positive integer weights in linear time, J. ACM 46 (1999), pp. 362–394.
P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett. 6 (1977), pp. 80–82.
P. van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Syst. Theory 10 (1977), pp. 99–127.
P. D. Whiting and J. A. Hillier, A method for finding the shortest route through a road network, Oper. Res. Quart. 11 (1960), pp. 37–40.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagerup, T. (2000). Improved Shortest Paths on the Word RAM. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_7
Download citation
DOI: https://doi.org/10.1007/3-540-45022-X_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67715-4
Online ISBN: 978-3-540-45022-1
eBook Packages: Springer Book Archive