Improvements in double ended priority queues

In this paper, we present improved algorithms for min-max pair heaps introduced by S. Olariu et al. (A Mergeable Double-ended Priority Queue - The Comp. J. 34, 423-427, 1991). We also show that in the worst case, this structure, though slightly costlier to create, is better than min-max heaps of Str...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 80; no. 9; pp. 1121 - 1129
Main Authors Rahman, M. Ziaur, Chowdhury, Rezaul Alam, Kaykobad, M.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis Group 01.09.2003
Taylor and Francis
Subjects
Algorithm
Applied sciences
Exact sciences and technology
Heap
Min-Max Heap
Min-Max Pair Heap
Operational research and scientific management
Operational research. Management science
Priority Queues
Queuing theory. Traffic theory
Priority
Insertion
Average
Cluster
Data
Algorithm
Priority queeu
Experimental result
Queueing system
Minimax problem
1991
Deletion
Exceptions
Technique
Structure
Queue
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present improved algorithms for min-max pair heaps introduced by S. Olariu et al. (A Mergeable Double-ended Priority Queue - The Comp. J. 34, 423-427, 1991). We also show that in the worst case, this structure, though slightly costlier to create, is better than min-max heaps of Strothotte (Min-max Heaps and Generalized Priority Queues - CACM, 29(10), 996-1000, Oct, 1986) in respect of deletion, and is equally good for insertion when an improved technique using binary search is applied. Experimental results show that, in the average case, with the exception of creation phase data movement, our algorithm outperforms min-max heap of Strothotte in all other aspects.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/207160310001599079