Finding real-valued single-source shortest paths in o(n3) expected time

Journal of Algorithms

Volumn 28, Issue 1, 1998, Pages 125-141

  Kolliopoulos, Stavros G ^a   Stein, Clifford ^a  

^a Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040504200     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0937     Document Type: Article

References (31)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network Flows," Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. N. Alon, Z. Galil, and O. Margalit, On the exponent of the all pairs shortest path problem, in "Proc. 32nd IEEE Symp. Found. Comp. Sci.," pp. 569-575, 1991.
3. R. Bellman, On a routing problem, Quart. Appl. Math. 16 (1958), 87-90.
4. P. A. Bloniarz, A. Meyer and M. Fischer, Some observations on Spira's shortest path algorithm, Tech. Rep. 79-6, Comp. Sci. Dept, State University of New York at Albany, Albany, NY, 1979.
5. 2 log n log * n), SIAM J. Comput. 12 (1983), 588-600.
6. J. S. Carson and A. M. Law, A note on Spira's algorithm for the all-pairs shortest path problem, SIAM J. Comput. 6 (1977), 696-699.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
8. G. B. Dantzig, On the shortest route through a network, Management Sci. 6 (1960), 187-190.
9. N. Deo and C. Pang, Shortest-path algorithms: Taxonomy and annotation, Networks 14 (1984), 275-323.
10. E. W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (1959), 269-271.
11. L. R. Ford, Jr., and D. R. Fulkerson, "Flows in Networks," Princeton Univ. Press, Princeton, NJ, 1962.
12. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization problems, J. Assoc. Comput. Mach. 34 (1987), 596-615.
13. A. M. Frieze and G. R. Grimmet, The shortest-path problem for graphs with random arc-lengths, Discrete Appl. Math. 10 (1985), 57-77.
14. H. N. Gabow, Scaling algorithms for network problems, J. Comput. Syst. Sci. 31 (1985), 148-168.
15. H. N. Gabow and R. E. Tarjan, Faster scaling algorithms for network problems, SIAM J. Comput. 18 (1989), 1013-1036.
16. M. S. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, CA, 1979.
17. A. V. Goldberg, Scaling algorithms for the shortest path problem, SIAM J. Comput. 24 (1995), 494-504.
18. D. Goldfarb, J. Hao, and S. R. Kai, "A computational comparison of label correcting and simplex algorithms for computing shortest paths," Tech. Rep., IEOR Dept., Columbia University, 1986.
19. R. Hassin and E. Zemel, On the shortest paths in graphs with random weights, Math. Oper. Res., 10 (1985), 557-564.
20. D. R. Karger, P. N. Klein, and R. E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, J. Assoc. Comput. Mach. 42 (1995), 321-328.
21. D. R. Karger and C. Stein, A new approach to the minimum cut problem, J. Assoc. Comput. Mach. 43 (1996), 601-640.
22. R. M. Karp, A characterization of the minimum cycle mean in a digraph, Discrete Math. 23 (1978), 309-311.
23. R. M. Karp, An algorithm to solve the M × N assignment problem in expected time O(MN log N), Networks 10 (1980), 143-152.
24. 3) expected time, in "Proc. 5th MPS Integer Programming and Combinatorial Optimization Conference," Lecture Notes in Computer Science, Vol. 1084, (W. H. Cunningham, S. T. McCormick, M. Queyranne, eds.), pp. 94-104, Springer-Verlag, Berlin, 1996.
25. H. W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Logist. 2 (1955), 83-97.
26. K. Mehlhorn and V. Priebe, On the all-pairs shortest path algorithm of Moffat and Takaoka, Random Structures and Algorithms 10 (1997), 205-220.
27. 2 log n), SIAM J. Comput. 16 (1987), 1023-1031.
28. R. Seidel, On the all-pairs-shortest-path problem, in "Proc. 24th ACM Symp. on Theory of Computing," pp. 745-749, 1992.
29. 2 n), SIAM J. Comput. 2 (1973), 28-32.
30. 2 log n log log n) expected time algorithm for the all shortest distance problem, in "Mathematical Foundations of Computer Science, Lecture Notes in Computer Science" (P. Dembinski, Ed.), Vol. 88, pp. 643-655, Springer-Verlag, Berlin, 1980.
31. S. K. Walley and H. H. Tan, Shortest paths in random weighted graphs, in "Proc. 1st Int. Conf. on Computing and Combinatorics," pp. 213-222, 1995.