Two-level heaps: A new priority queue structure with applications to the single source shortest path problem

K. Subramani, Kamesh Madduri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Single Source Shortest Paths problem with positive edge weights (SSSPP) is one of the more widely studied problems in Operations Research and Theoretical Computer Science [1,2] on account of its wide applicability to practical situations. This problem was first solved in polynomial time by Dijkstra [3], who showed that by extracting vertices with the smallest distance from the source and relaxing its outgoing edges, the shortest path to each vertex is obtained. Variations of this general theme have led to a number of algorithms, which work well in practice [4,5,6]. At the heart of a Dijkstra implementation is the technique used to implement a priority queue. It is well known that using Dijkstra's approach requires Ω(nlogn) steps on a graph having n vertices, since it essentially sorts vertices based on their distances from the source. Accordingly, the fastest implementation of Dijkstra's algorithm on a graph with n vertices and m edges should take Ω(m+n•logn) time and consequently the Dijkstra procedure for SSSPP using Fibonacci Heaps is optimal, in the comparison-based model. In this paper, we introduce a new data structure to implement priority queues called Two-Level Heap (TLH) and a new variant of Dijkstra's algorithm called Phased Dijkstra. We contrast the performance of Dijkstra's algorithm (both the simple and the phased variants) using a number of data structures to implement the priority queue and empirically establish that Two-Level heaps are far superior to Fibonacci heaps on every graph family considered.

Original languageEnglish (US)
Title of host publicationCombinatorial Optimization and Applications - Third International Conference, COCOA 2009, Proceedings
Pages186-196
Number of pages11
DOIs
StatePublished - Nov 9 2009
Event3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009 - Huangshan, China
Duration: Jun 10 2009Jun 12 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5573 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009
CountryChina
CityHuangshan
Period6/10/096/12/09

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Two-level heaps: A new priority queue structure with applications to the single source shortest path problem'. Together they form a unique fingerprint.

Cite this