A Survey on Priority Queues

Abstract

Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and Ex-tractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority queues has taken the last 50 years.

A fast algorithm for quadratic resource allocation problems with nested constraints

“…Double-ended priority queues can be implemented using specialized data structures such as min-max heaps [4] or by a simple coupling of a standard min-heap and max-heap (see also [8]). The latter heaps are one of the most basic data structures and many efficient implementation exist for different programming languages [9]. Thus, we can achieve the time complexity of O(n log n) using relatively simple data structures, as opposed to ALG dec , where a more involved implementation of a linear-time median algorithm is required.…”

Few versatile vs. many specialized collections: how to design a collection library for exploratory programming?

“…The Eclipse Collections library 6 also extends the Java collection library. Similarly to Guava, it adds bidirectional maps, multi-maps, bags, and provide additional utilities.…”

“…The inal set of design dimensions are implementation choices, which include the selection of a speciic algorithm or data structure to realize a collection. Literature describes a large variety of special-purpose data structures [6,22,34,36], especially for concurrent applications [18,21,26,33,37]. However, there seem to be a few favorites that are recurring.…”

Duality-driven optimization in energy management: offline and online algorithms for resource allocation problems

“…Double-ended priority queues can be implemented using specialized data structures such as min-max heaps [11] or by a simple coupling of a standard min-heap and max-heap (see also [30]). The latter heaps are one of the most basic data structures and many efficient implementations exist for different programming languages [31]. Thus, we can achieve the time complexity of O(n log n) using relatively simple data structures, as opposed to ALG dec that requires a more involved implementation of a linear-time median algorithm.…”