Simpler computation of single-source shortest paths in linear average time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 362-369

  Hagerup, Torben ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

LINEAR AVERAGES; PROBABILISTIC ANALYSIS; RANDOM EDGES; SINGLE SOURCE SHORTEST PATHS; UNIFORM DISTRIBUTION;

GRAPH THEORY;

EID: 35048859776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_32     Document Type: Article

References (10)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. G. B. Dantzig, On the shortest route through a network, Management Sei. 6 (1960), pp. 187-190.
3. E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959), pp. 269-271.
4. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34 (1987), pp. 596-615.
5. A. V. Goldberg, A simple shortest path algorithm with linear average time, Proc. 9th Annual European Symposium on Algorithms, (ESA 2001), Lecture Notes in Computer Science, Springer, Berlin, Vol. 2161, pp. 230-241.
6. T. Hagerup and C. Rub, A guided tour of Chernoff bounds, Inform. Proc. Lett. 33 (1990), pp. 305-308.
7. U. Meyer, Single-source shortest-paths on arbitrary directed graphs in linear average-case time, Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 797-806.
8. U. Meyer, Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds, J. Algorithms 48 (2003), pp. 91-134.
9. M. Thorup, Integer priority queues with decrease key in constant time and the single source shortest paths problem, Proc. 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 149-158.
10. P. D. Whiting and J. A. Hillier, A method for finding the shortest route through a road network, Oper. Res. Quart. 11 (1960), pp. 37-40.