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

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 149-158

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Fibonacci heaps; Priority queues; Single source shortest paths

Indexed keywords

DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

INTEGER PRIORITY QUEUES;

QUEUEING NETWORKS;

EID: 0038107746     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780564.780566     Document Type: Conference Paper

References (26)

1. R. K. Ahuja, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan. Faster algorithms for the shortest path problem. J. ACM, 37(2):213-223, 1990.
2. th FOCS, pages 135-141, 1996.
3. A. Andersson and M. Thorup. Dynamic ordered sets with exponential search trees. Technical Report cs.DS/0210006, The Computing Research Repository (CoRR), 2002. http://arKiv.org/abs/cs.DS/0210006.
4. P. Beame and J. Håstad. Optimal bounds for decision problems on the CROW PRAM. J. ACM, 36(3):643-670, 1989.
5. B.V. Cherkassky, A.V. Goldberg, and C. Silverstein. Buckets, heaps, lists, and monotone priority queues. SIAM J. Comput., 28(4):1326-1346, 1999. Announced at SODA'97.
6. L. J. Comrie. The hollerith and powers tabulating machines. Thins. Office Machinery Users' Assoc., Ltd, pages 25-37, 1929-30.
7. D.V. Denardo and B.L. Fox. Shortest-route methods 1: Reaching, pruning, and buckets. Oper. Res., 27:161-186, 1979.
8. R. B. Dial. Algorithm 360: Shortest path forest with topological ordering. Comm. ACM, 12(11):632-633, 1969.
9. E. W. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1:269-271, 1959.
10. J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan. Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Comm. ACM, 31(11):1343-1354, 1988.
11. A. I. Dumey. Indexing for rapid random access memory systems. Computers and Automation, 5(12):6-9, 1956.
12. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987. Announced at FOCS'84.
13. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci., 47:424-436, 1993. Announced at STOC'90.
14. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci., 48:533-551, 1994.
15. th ICALP, LNCS 1853, pages 61-72, 2000.
16. th STOC, pages 602-608, 2002.
17. rd FOCS, pages 135-144, 2002.
18. IEEE. Standard for binary floating-point arithmetic. ACM Sigplan Notices, 22:9-25, 1985.
19. B.W. Kernighan and D.M. Ritchie. The C Programming Language. Prentice Hall, second edition, 1988.
20. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, second edition, 1998.
21. R. Raman. Recent results on the single-source shortest paths problem. SIGACT News, 28(2):81-87, 1997.
22. M. Thorup. Undirected single source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362-394, 1999. Announced at FOCS'97.
23. M. Thorup. On RAM priority queues. SIAM J. Comp., 30(1):86-109, 2000. Announced at SODA'96.
24. M. Thorup. Equivalence between priority queues and sorting. In Proc. 43rd FOCS, pages 125-134, 2002.
25. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Inf. Proc. Lett., 6(3):80-82, 1977.
26. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Syst. Theory, 10:99-127, 1977.