Results 1 
3 of
3
A Practical Shortest Path Algorithm with Linear Expected Time
 SUBMITTED TO SIAM J. ON COMPUTING
, 2001
"... We present an improvement of the multilevel bucket shortest path algorithm of Denardo and Fox [9] and justify this improvement, both theoretically and experimentally. We prove that if the input arc lengths come from a natural probability distribution, the new algorithm runs in linear average time ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present an improvement of the multilevel bucket shortest path algorithm of Denardo and Fox [9] and justify this improvement, both theoretically and experimentally. We prove that if the input arc lengths come from a natural probability distribution, the new algorithm runs in linear average time while the original algorithm does not. We also describe an implementation of the new algorithm. Our experimental data suggests that the new algorithm is preferable to the original one in practice. Furthermore, for integral arc lengths that fit into a word of today's computers, the performance is close to that of breadthfirst search, suggesting limitations on further practical improvements.
AverageCase Complexity of ShortestPaths Problems
"... We study both upper and lower bounds on the averagecase complexity of shortestpaths algorithms. It is proved that the allpairs shortestpaths problem on nvertex networks can be solved in time O(n 2 log n) with high probability with respect to various probability distributions on the set of inpu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study both upper and lower bounds on the averagecase complexity of shortestpaths algorithms. It is proved that the allpairs shortestpaths problem on nvertex networks can be solved in time O(n 2 log n) with high probability with respect to various probability distributions on the set of inputs. Our results include the first theoretical analysis of the average behavior of shortestpaths algorithms with respect to the vertexpotential model, a family of probability distributions on complete networks with arbitrary real arc costs but without negative cycles. We also generalize earlier work with respect to the common uniform model, and we correct the analysis of an algorithm with respect to the endpointindependent model. For the algorithm that solves the allpairs shortestpaths problem on networks generated according to the vertexpotential model, a key ingredient is an algorithm that solves the singlesource shortestpaths problem on such networks in time O(n 2 ) with high probability. All algorithms mentioned exploit that with high probability, the singlesource shortestpaths problem can be solved correctly by considering only a rather sparse subset of the arc set. We prove a lower bound indicating the limitations of this approach. In a fairly general probabilistic model, any algorithm solving the singlesource shortestpaths problem has to inspect# n log n) arcs with high probability. Kurzzusammenfassung. In dieser Arbeit werden sowohl obere als auch untere Schranken f ur die averagecaseKomplexit at von K urzesteWegeAlgorithmen untersucht. Wir beweisen f ur verschiedene Wahrscheinlichkeitsverteilungen auf Netzwerken mit n Knoten, dass das allpairs shortestpaths problem mit hoher Wahrscheinlichkeit in Zeit O(n 2 log n) gel ost werden kann. Insbeso...