Abstract
We present a simple black box that takes a priority queue Q which supports find-min, insert, and delete in x-time at most t. Here x-time may be worst-case, expected, or amortized. The black-box transforms Q into a priority queue Q* that supports find-min in constant time, insert in constant x-time, and delete in x-time O(t). Moreover, if Q supports dec-key in constant time, then so does Q*.
- Ahuja, R. K., Mehlhorn, K., Orlin, J., and Tarjan, R. 1990. Faster algorithms for the shortest path problem. J. ACM 37, 2, 213--223. Google ScholarDigital Library
- Alstrup, S., Husfeldt, T., and Rauhe, T. 1998a. Marked ancestor problems. Tech. Rep. DIKU 98-8, Dept. Comput. Sc., Univ. Copenhagen.Google Scholar
- Alstrup, S., Husfeldt, T., and Rauhe, T. 1998b. Marked ancestor problems. In Proceedings of the 39th Annual Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 534--544. Google ScholarDigital Library
- Brodal, G. 1996. Worst-case efficient priority queues. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 52--58. Google ScholarDigital Library
- Cherkassky, B., Goldberg, A., and Silverstein, C. 1999. Buckets, heaps, lists, and monotone priority queues. SIAM J. Comput. 28, 4, 1326--1346. Google ScholarDigital Library
- Dijkstra, E. W. 1959. A note on two problems in connection with graphs. Numer. Math. 1, 269--271.Google ScholarDigital Library
- Mendelson, R., Tarjan, R., Thorup, M., and Zwick, U. 2004. Melding priority queues. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 3111. Springer-Verlag, New York, 223--235.Google Scholar
- Thorup, M. 2002. Equivalence between priority queues and sorting. In Proceedings of the 43rd Annual Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 125--134. Google ScholarDigital Library
Index Terms
Black box for constant-time insertion in priority queues (note)
Recommendations
Equivalence between priority queues and sorting
We present a general deterministic linear space reduction from priority queues to sorting implying that if we can sort up to n keys in S(n) time per key, then there is a priority queue supporting delete and insert in O(S(n)) time and find-min in ...
On RAM Priority Queues
Priority queues are some of the most fundamental data structures. For example, they are used directly for task scheduling in operating systems. Moreover, they are essential to greedy algorithms. We study the complexity of integer priority queue ...
Melding priority queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) amortized time, where n is an upper bound on the number of elements in the priority queue, can be converted into a priority queue data ...
Comments