A Framework for Speeding Up Priority-Queue Operations

@inproceedings{Elmasry2004AFF,
  title={A Framework for Speeding Up Priority-Queue Operations},
  author={Amr Elmasry and Claus Jensen and Jyrki Katajainen},
  year={2004}
}
We introduce a framework for reducing the number of element comparisons performed in priority-queue operations. In particular, we give a priority queue which guarantees the worst-case cost of O(1) per minimum finding and insertion, and the worst-case cost of O(log n) with at most log n + O(1) element comparisons per minimum deletion and deletion, improving the bound of 2 log n + O(1) on the number of element comparisons known for binomial queues. Here, n denotes the number of elements stored in… CONTINUE READING
8 Citations
23 References
Similar Papers

Similar Papers

Loading similar papers…