A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
2010
Computing
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
doi:10.1007/s00607-010-0112-1
fatcat:dtyxzofivzfmxlmx3io77qi4zu