Improved shortest paths on the word RAM

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 61-72

  Hagerup, Torben ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIRECTED GRAPHS; FORESTRY; RANDOM ACCESS STORAGE; ROBOTS;

ALL PAIRS SHORTEST PATHS; DIRECTED NETWORK; LINEAR SPACE BOUNDS; RANDOM ACCESS MACHINES; SIMPLE ALGORITHM; SINGLE SOURCE SHORTEST PATHS; SPARSE NETWORK; UNDIRECTED NETWORK;

TREES (MATHEMATICS);

EID: 84974533426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_7     Document Type: Conference Paper

References (24)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. 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.
3. R. Bellman, On a routing problem, Quart. Appl. Math. 16 (1958), pp. 87-90.
4. B. V. Cherkassky, A. V. Goldberg, and C. Silverstein, Buckets, heaps, lists, and monotone priority queues, SIAM J. Comput. 28 (1999), pp. 1326-1346.
5. G. B. Dantzig, On the shortest route through a network, Management Sci. 6 (1960), pp. 187-190.
6. E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959), pp. 269-271.
7. L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
8. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34 (1987), pp. 596-615.
9. 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.
10. 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.
11. 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.
12. D. B. Johnson, Efficient algorithms for shortest paths in sparse networks, J. ACM 24 (1977), pp. 1-13.
13. R. C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36 (1957), pp. 1389-1401.
14. 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.
15. R. Raman, Recent results on the single-source shortest paths problem, SIGACT News 28:2 (1997), pp. 81-87.
16. 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.
17. R. E. Tarjan, Efficiency of a good but not linear set union algorithm, J. ACM 22, (1975), pp. 215-225.
18. M. Thorup, On RAM priority queues, in Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), pp. 59-67.
19. 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.
20. 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.
21. M. Thorup, Undirected single-source shortest paths with positive integer weights in linear time, J. ACM 46 (1999), pp. 362-394.
22. 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.
23. 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.
24. 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.