Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We present a generalization of binomial queues, the definition of which involves a freely chosen sequence $m_1$, $m_2$, $m_3$,... of integers greater than one. Different sequences lead to different worst case bounds for the priority queue operations, allowing the user to adapt the data structure to the needs of a specific application. Examples include the first priority queue to combine a sub-logarithmic worst case bound for {\it Meld} with a sub-linear worst case bound for {\it Delete_min}.