Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation

Abstract

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.

DOI: 10.1145/50087.50096

Extracted Key Phrases

6 Figures and Tables

Statistics

01020'93'96'99'02'05'08'11'14'17
Citations per Year

226 Citations

Semantic Scholar estimates that this publication has 226 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Driscoll1988RelaxedHA, title={Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation}, author={James R. Driscoll and Harold N. Gabow and Ruth Shrairman and Robert E. Tarjan}, journal={Commun. ACM}, year={1988}, volume={31}, pages={1343-1354} }