Average-case complexity of shortest-paths problems in the vertex-potential model

Random Structures and Algorithms

Volumn 16, Issue 1, 2000, Pages 33-46

  Cooper, Colin ^a   Frieze, Alan ^b   Mehlhorn, Kurt ^c   Priebe, Volker ^c  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034418745     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(200001)16:1<33::AID-RSA3>3.0.CO;2-0     Document Type: Article

References (26)

1. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan, Faster algorithms for the shortest path problem, J Assoc Comput Mach 37 (1990), 213-223.
2. R. Bellman, On a routing problem, Quart Appl Math 16 (1958), 87-90.
3. 2 log n log* n), SIAM J Comput 12 (1983), 588-600.
4. B.V. Cherkassky, A.V. Goldberg, and T. Radzik, Shortest paths algorithms: Theory and experimental evaluation, Math Programming 73 (1996), 129-174.
5. B.V. Cherkassky, A.V. Goldberg, and C. Silverstein, Buckets, heaps, lists, and monotone priority queues, SIAM J Comput 28 (1999), 1326-1346.
6. C. Cooper, A. Frieze, K. Mehlhorn, and V. Priebe, "Average-case complexity of shortest-paths problems in the vertex-potential model," Randomization and Approximation Techniques in Computer Science, J. Rolim (Editor), Lecture Notes in Computer Science, vol 1269, Springer-Verlag, Berlin, 1997, pp. 15-26.
7. R. Davis and A. Prieditis, The expected length of a shortest path, Inform Process Lett 46 (1993), 135-141.
8. E.W. Dijkstra, A note on two problems in connexion with graphs, Numer Math 1 (1959), 269-271.
9. J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, J Assoc Comput Mach 19 (1972), 248-264.
10. L.R. Ford, Jr., and D.R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton, NJ, 1962.
11. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J Assoc Comput Mach 34 (1987), 596-615.
12. A.M. Frieze and G.R. Grimmett, The shortest-path problem for graphs with random arc-lengths, Discrete Appl Math 10 (1985), 57-77.
13. A.V. Goldberg, Scaling algorithms for the shortest paths problem, SIAM J Comput 24 (1995), 494-504.
14. R. Hassin and E. Zemel, On shortest paths in graphs with random weights, Math Oper Res 10 (1985), 557-564.
15. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Amer Statist Assoc 58 (1963), 13-30.
16. S. Janson, One, two and three times log n/n for paths in a complete graph with random weights, Combin Probab Comput, to appear.
17. D.B. Johnson, Efficient algorithms for shortest paths in sparse networks, J Assoc Comput Mach 24 (1977), 1-13.
18. D.R. Karger, D. Koller, and S.J. Phillips, Finding the hidden path: Time bounds for all-pairs shortest paths, SIAM J Comput 22 (1993), 1199-1217.
19. 3) expected time, J Algorithms 28 (1998), 125-141.
20. C. McDiarmid, "Concentration," Probabilistic Methods for Algorithmic Discrete Mathematics, M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed (Editors), Algorithms and Combinatorics, vol 16, Springer-Verlag, Berlin, 1998, pp. 195-248.
21. C.C. McGeoch, All-pairs shortest paths and the essential subgraph, Algorithmica 13 (1995), 426-441.
22. K. Mehlhorn and V. Priebe, On the all-pairs shortest-path algorithm of Moffat and Takaoka, Random Struct Alg 10 (1997), 205-220.
23. 2log n), SIAM J Comput 16 (1987), 1023-1031.
24. K. Noshita, A theorem on the expected complexity of Dijkstra's shortest path algorithm J Algorithms, 6 (1985) 400-408.
25. S.M. Ross, Stochastic Processes, 2nd ed., Wiley, New York, 1996.
26. 2 n), SIAM J Comput 2 (1973), 28-32.