Buckets, heaps, lists, and monotone priority queues

Conference · Sun Jun 01 04:00:00 EDT 1997

OSTI ID:471662

Cherkassky, B V ^[1]; Goldberg, A V ^[2]; Silverstein, C ^[3]

---

1. Central Economic and Mathmatical Inst., Moscow (Russian Federation)
2. NEC Research Institute, Princeton, NJ (United States)
3. Stanford Univ., CA (United States)

We introduce the heap-on-top (hot) priority queue data structure that combines the multi-level bucket data structure of Denardo and Fox and a heap. We use the new data structure to obtain an O(m + n(log C){sup 1/3+{epsilon}}) expected time implementation of Dijkstra`s shortest path algorithm, improving the previous bounds. We can implement hot queues even more efficiently in practice by using sorted lists to represent small priority queues. Our experimental results in the context of Dijkstra`s algorithm show that this implementation of hot queues performs very well and is more robust than implementations based only on heap or multi-level bucket data structures.

• OSTI ID: 471662
• Report Number(s): CONF-970142--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
DIAGRAMS
INFORMATION RETRIEVAL
MEMORY MANAGEMENT
OPTIMIZATION