Integer priority queues with decrease key in constant time and the single source shortest paths problem

Journal of Computer and System Sciences

Volumn 69, Issue 3 SPEC. ISS., 2004, Pages 330-353

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Decrease key; Fibonacci heaps; Integer priority queues; Single source shortest paths

Indexed keywords

ALGORITHMS; AMORPHIZATION; OPERATIONS RESEARCH; SORTING; THEOREM PROVING;

DECREASE KEY; FIBONACI HEAPS; INTEGER PRIORITY QUEUES; SINGLE SOURCE SHORTEST PATHS;

PROBLEM SOLVING;

EID: 4544284899     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.04.003     Document Type: Conference Paper

References (31)

1. Ahuja R.K., Mehlhorn K., Orlin J.B., Tarjan R.E. Faster algorithms for the shortest path problem. J. ACM. 37(2):1990;213-223.
2. S. Alstrup, T. Husfeldt, T. Rauhe, Marked ancestor problems, Technical Report 98/8, Department of Computer Science, University of Copenhagen, 1998 (short version from FOCS'98 does not contain the reduction needed here).
3. A. Andersson, Faster deterministic sorting and searching in linear space, in: Proceedings of the 37th FOCS, 1996, pp. 135-141.
4. 0 RAMs: Query time Θ(√log n/log log n ) is necessary and sufficient, in: Proceedings of the 37th FOCS, 1996, pp. 441-450.
5. A. Andersson, M. Thorup, Dynamic ordered sets with exponential search trees, Technical Report cs.DS/0210006, The Computing Research Repository (CoRR), 2002. http://arXiv.org/abs/cs.DS/0210006.
6. Beame P., Håstad J. Optimal bounds for decision problems on the CRCW PRAM. J. ACM. 36(3):1989;643-670.
7. Cherkassky B.V., Goldberg A.V., Silverstein C. Buckets, heaps, lists, and monotone priority queues. SIAM J. Comput. 28(4):1999;1326-1346. (announced at SODA'97).
8. L.J. Comrie, The hollerith and powers tabulating machines, Transactions of the Office Machinery Users Association Limited, 1929-30, pp. 25-37.
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 2nd Edition, MIT Press, McGraw-Hill, 2001. ISBN 0-262-03293-7, 0-07-013151-1.
10. Denardo D.V., Fox B.L. Shortest-route methods 1. reaching, pruning and buckets Oper. Res. 27:1979;161-186.
11. Dial R.B. Algorithm 360. shortest path forest with topological ordering Comm. ACM. 12(11):1969;632-633.
12. Dijkstra E.W. A note on two problems in connection with graphs. Numer. Math. 1:1959;269-271.
13. Driscoll J.R., Gabow H.N., Shrairman R., Tarjan R.E. Relaxed heaps. an alternative to Fibonacci heaps with applications to parallel computation Comm. ACM. 31(11):1988;1343-1354.
14. Dumey A.I. Indexing for rapid random access memory systems. Comput. Automat. 5(12):1956;6-9.
15. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM. 34(3):1987;596-615. (announced at FOCS'84).
16. Fredman M.L., Willard D.E. Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47:1993;424-436. (announced at STOC'90).
17. Fredman M.L., Willard D.E. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. System Sci. 48:1994;533-551. (announced at FOCS'90).
18. T. Hagerup, Improved shortest paths on the word RAM, in: Proceedings of the 27th ICALP, Lecture Notes in Computer Science, Vol. 1853, 2000, pp. 61-72.
19. Han Y. Deterministic sorting in. O(n log log n) time and linear space J. Algorithms. 50(1):2004;95-105. (announced at STOC'02).
20. Y. Han, M. Thorup, Integer sorting in O(n log log n ) expected time and linear space, in: Proceedings of the 43rd FOCS, 2002, pp. 135-144.
21. IEEE, Standard for binary floating-point arithmetic, ACM Sigplan Notices 22 (1985) 9-25.
22. Kernighan B.W., Ritchie D.M. The C Programming Language. 2nd Edition:1988;Prentice-Hall, Englewood Cliffs, NJ.
23. Knuth D.E. The Art of Computer Programming, Volume 3: Sorting and Searching. 2nd Edition:1998;Addison-Wesley, Reading, MA.
24. R. Raman, Priority queues: small, monotone and trans-dichotomous, in: Proceedings of the Fourth ESA, Lecture Notes in Computer Science, Vol. 1136, 1996, pp. 121-137.
25. Raman R. Recent results on the single-source shortest paths problem. SIGACT News. 28(2):1997;81-87.
26. Thorup M. Undirected single source shortest paths with positive integer weights in linear time. J. ACM. 46(3):1999;362-394. (announced at FOCS'97).
27. Thorup M. On RAM priority queues. SIAM J. Comput. 30(1):2000;86-109. (announced at SODA'96).
28. M. Thorup, Equivalence between priority queues and sorting, in: Proceedings of the 43rd FOCS, 2002, pp. 125-134.
29. 0 implementations of fusion trees and atomic heaps, in: Proceedings of the 14th SODA, 2003, pp. 699-707.
30. van Emde Boas P. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett. 6(3):1977;80-82.
31. van Emde Boas P., Kaas R., Zijlstra E. Design and implementation of an efficient priority queue. Math. System Theory. 10:1977;99-127.