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

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

Volumn 1269, Issue , 1997, Pages 15-26

  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

DIRECTED GRAPHS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

ALL PAIRS SHORTEST PATHS; AVERAGE-CASE COMPLEXITY; EDGE LENGTH; EXPECTED TIME; POTENTIAL MODEL; SHORTEST PATH; SINGLE SOURCE SHORTEST PATHS;

GRAPH THEORY;

EID: 84957699932     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63248-4_2     Document Type: Conference Paper

References (23)

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, Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans LA, 1997, 83-92
6. R. Davis and A. Prieditis, The expected length of a shortest path, Inform. Process. Lett. 46 (1993) 135-141
7. E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959) 269-271
8. J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, J. Assoc. Comput. Mach. 19 (1972) 248-264
9. L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton NJ, 1962
10. 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
11. A. M. Frieze and G. R. Grimmett, The shortest-path problem for graphs with random arc-lengths, Discrete Appl. Math. 10 (1985) 57-77
12. A. V. Goldberg, Scaling algorithms for the shortest paths problem, SIAM J. Comput. 24 (1995) 494-504
13. T. Hagerup and C. Rüb, A guided tour of Chemoff bounds, Inform. Process. Lett. 33 (1989/90) 305-308
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. D. B. Johnson, Efficient algorithms for shortest paths in sparse networks, J. Assoc. Comput. Mach. 24 (1977) 1-13
17. D. R. Karger, D. Roller, and S. J. Phillips, Finding the hidden path: Time bounds for all-pairs shortest paths, SIAM J. Comput. 22 (1993) 1199-1217
18. 3) expected time, in: W. H. Cunningham, S. T. McCormick, and M. Queyranne (Eds.), Integer Programming and Combinatoríal Optimization (Lecture Notes in Computer Science; 1084), Springer-Verlag, Berlin, 1996, 94-104
19. C. C. McGeoch, All-pairs shortest paths and the essential subgraph, Algorithmica 13 (1995) 426-441
20. K. Mehlhom and V. Priebe, On the all-pairs shortest-path algorithm of Moffat and Takaoka, Random Structures Algorithms 10 (1997) 205-220
21. 2 log n), SIAM J. Comput. 16 (1987) 1023-1031
22. K. Noshita, A theorem on the expected complexity of Dijkstra's shortest path algorithm, J. Algorithms 6 (1985) 400-408
23. 2 n), SIAM J. Comput. 2 (1973) 28-32