Sorting Jordan sequences in linear time using level-linked search trees
Information and Control
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A data structure for manipulating priority queues
Communications of the ACM
A Faster Deterministic Algorithm for Minimum Spanning Trees
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. In order to beat the standard informationtheoretic bounds, the soft heap allows errors: occasionally, the keys of certain items are artificially raised. Given any 0 n operations, the soft heap ensures that at most ∈n keys are raised at any time. The amortized complexity of each operation is constant, except for insert, which takes O(log 1/Ɛ) time. The soft heap is optimal. Also, being purely pointer-based, no arrays are used and no numeric assumptions are made on the keys. The novelty of the data structure is that items are moved together in groups, in a data-structuring equivalent of "car pooling." The main application of the data structure is a faster deterministic algorithm for minimum spanning trees.