Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Authors:
James R. Driscoll;Harold N. Gabow;Ruth Shrairman;Robert E. Tarjan
Affiliations:
Dartmouth College, Hanover, NH;Univ. of Colorado, Boulder;Univ. of Colorado, Boulder;Princeton Univ., and AT&T Bell Laboratories, Murray Hill, NJ
Venue:
Communications of the ACM
Year:
1988

Citing 8
Cited 49

Data structures and network algorithms

Data structures and network algorithms
Scaling algorithms for network problems

Journal of Computer and System Sciences
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Solving minimum-cost flow problems by successive approximation

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
A faster strongly polynomial minimum cost flow algorithm

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Almost-optimum speed-ups of algorithms for bipartite matching and related problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A data structure for manipulating priority queues

Communications of the ACM

Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Maintaining dynamic ordered sets on processor networks

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Worst-case efficient priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Intensive Data Management in Parallel Systems: A Survey

Distributed and Parallel Databases
Priority Queues and Sorting Methods for Parallel Simulation

IEEE Transactions on Software Engineering
Meldable heaps and boolean union-find

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Reducing the Complexity of Robot‘s Scene for Faster Collision Detection

Journal of Intelligent and Robotic Systems
Theory of 2-3 heaps

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
A Parallel Priority Data Structure with Applications

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Buckets Strike Back: Improved Parallel Shortest Paths

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Parallel Shortest Path for Arbitrary Graphs

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
De-amortization of Algorithms

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Theory of Trinomial Heaps

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Randomized Meldable Priority Queues

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
K-D Trees Are Better when Cut on the Longest Side

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The randomized complexity of maintaining the minimum

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

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Reflected min-max heaps

Information Processing Letters
Δ-stepping: a parallelizable shortest path algorithm

Journal of Algorithms
Navigation piles with applications to sorting, priority queues, and priority deques

Nordic Journal of Computing
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Journal of Computer and System Sciences - Special issue: STOC 2003
Calculating the meeting point of scattered robots on weighted terrain surfaces

CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Short communication: A novel parallelization approach for hierarchical clustering

Parallel Computing
An adjustable linear time parallel algorithm for maximum weight bipartite matching

Information Processing Letters
Integrating a real-world scheduling problem into the basic algorithms course

Journal of Computing Sciences in Colleges - Papers of the twelfth annual CCSC Northeastern Conference
On the power of structural violations in priority queues

CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Thin heaps, thick heaps

ACM Transactions on Algorithms (TALG)
Multipartite priority queues

ACM Transactions on Algorithms (TALG)
An adjustable linear time parallel algorithm for maximum weight bipartite matching

Information Processing Letters
A faster algorithm for the single source shortest path problem with few distinct positive lengths

Journal of Discrete Algorithms
A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Computers and Operations Research
Revisiting priority queues for image analysis

Pattern Recognition
The violation heap: a relaxed Fibonacci-like heap

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Policy-based benchmarking of weak heaps and their relatives,

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The complexity of implicit and space efficient priority queues

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Two-Tier relaxed heaps

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Fat heaps without regular counters

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Strict fibonacci heaps

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
QoS-aware automatic service composition: a graph view

Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
Rank-Pairing Heaps

SIAM Journal on Computing
Parallel computation of best connections in public transportation networks

Journal of Experimental Algorithmics (JEA)
The weak-heap data structure: Variants and applications

Journal of Discrete Algorithms
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors

Fundamenta Informaticae
The weak-heap family of priority queues in theory and praxis

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128

Quantified Score

Hi-index	48.22

Visualization

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.