Are Fibonacci Heaps Optimal? (1994)
by
Diab Abuaiadh
,
Jeffrey H. Kingston
| Venue: | ISAAC'94, LNCS |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Abuaiadh94arefibonacci,
author = {Diab Abuaiadh and Jeffrey H. Kingston},
title = {Are Fibonacci Heaps Optimal?},
booktitle = {ISAAC'94, LNCS},
year = {1994},
pages = {442--450},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable assumptions, there exist sequences of n Insert, n Delete, m DecreaseKey and t FindMin operations, where 1 t n, which have W(nlogt + n + m) complexity. Although Fibonacci heaps do not achieve this bound, we present a modified Fibonacci heap which does, and so is optimal under our assumptions.
Citations
| 2172 | The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974 |
| 493 | Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987 |
| 129 | Amortized computational complexity - Tarjan - 1985 |
| 84 | A data structure for manipulating priority queues - Vuillemin - 1978 |
| 47 | The pairing heap: A new form of self-adjusting heap - Fredman, Sedgewick, et al. - 1986 |
| 36 | Implementation and analysis of binomial queue algorithmms - Brown - 1978 |
| 20 | Algorithms and Data Structures: Design, Correctness, Analysis - Kingston - 1990 |
| 12 | A balanced tree scheme for meldable heaps with updates - Peterson - 1987 |
| 4 | An efficient algorithm for the shortest path problem - Abuaiadh, Kingston - 1993 |
| 1 | The Art of Computer Programming Volume 1: sorting and searching - Knuth - 1968 |
