Relaxed heaps
Journal Article
·
· Commun. ACM; (United States)
- Dept. of Mathematics and Computer Science, Dartmouth College, Hanover, NH (US)
- Dept. of Computer Science, Univ. of Colorado, Boulder, CO (US)
- Computer Science Dept., Princeton Univ., Princeton, NJ (US)
The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap - a sequence of m decrease key and n delete min operations takes time O(m + n log n). A variant of relaxed heaps achieves similar bounds in the worst case - O(1) time for decrease key and O(log n) for delete min. Relaxed heaps give a processor-efficient parallel implementation of Dijkstra's shortest path algorithm, and hence other algorithms in network optimization. A relaxed heap is a type of binomial queue that allows heap order to be violated.
- OSTI ID:
- 6526005
- Journal Information:
- Commun. ACM; (United States), Vol. 31:11
- Country of Publication:
- United States
- Language:
- English
Similar Records
Buckets, heaps, lists, and monotone priority queues
On RAM priority queues
Fully dynamic output bounded single source shortest path problem
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:6526005
On RAM priority queues
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:6526005
Fully dynamic output bounded single source shortest path problem
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:6526005