Computing shortest paths with comparisons and additions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 267-276

  Pettie, Seth ^a   Ramachandran, Vijaya ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPH THEORY;

ALL PAIRS SHORTEST PATHS; EDGE LENGTH; INTEGER WEIGHTS; INVERSE ACKERMANN FUNCTION; POINTER MACHINES; SHORTEST PATH; SINGLE SOURCE SHORTEST PATHS; TIME COMPARISON;

ALGORITHMS;

EID: 84968902218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (45)

1. [AHU74] A. V. Aho, J. E. Hopcroft, J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesly, 1974.
2. [AM+90] R. Ahuja, K. Mehlhorn, J. Orlin, R. E. Tarjan. Faster algorithms for the shortest path problem. J. Assoc. Comput. Mach. 37 (1990), No. 2, 213-223.
3. [AGM97] N. Alon, Z. Galil, O. Margalit. On the exponent of the all pairs shortest paths problem. J. Comput. Sys. Sci. 54 (1997), 255-262.
4. [B+98] A. L. Buchsbaum, H. Kaplan, A. M. Rogers, J. R. Westbrook. Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators. In Proc. STOC 1998, 279-288.
5. [ChazOO] B. Chazelle. A minimum spanning tree algorithm with Inverse-Ackermann type complexity. In JACM 47 (2000), No. 6, 1028-1047.
6. [CKT00] D. Z. Chen, K. S. Klenk, H. T. Tu. Shortest path queries among weighted obstacles in the rectilinear plane. SIAM J. Comput. 29 (2000), No. 4, 1223-1246.
7. [CGS97] B. V. Cherkassky, A. V. Goldberg, C. Silverstein. Buckets, heaps, lists, and monotone priority queues. In Proc. SODA 1997, 83-92.
8. [CLR90] T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. MIT Press, 1990.
9. [Dij59] E. W. Dijkstra. A note on two problems in connexion with graphs. In Numer. Math., 1 (1959), 269-271.
10. [Din78] E. A. Dinic. Economical algorithms for finding shortest paths in a network. Transportation Modeling Systems, Y.S. Popkov and B.L. Shmulyian (eds), Institute for System Studies, Moscow, pp. 36-44, 1978.
11. [EH97] D. Eppstein, D. Hart. An efficient algorithm for shortest paths in vertical and horizontal segments. In Proc. WADS 1997, LNCS 1272, p. 234.
12. [EH99] D. Eppstein, D. Hart. Shortest paths in an arrangement with k-line orientations. In Proc. SODA 1999, 310-316.
13. [FR01] J. Fakcharoenphol, S. Rao. Planar graphs, negative weight edges, shortest paths and near linear time. In Proc. FOCS 2001.
14. [Fre91] G. N. Frederickson. Planar graph decomposition and all pairs shortest paths. J. Assoc. Comput. Much. 38 (1991), No. 1, 162-204.
15. [F76] M. Fredman. New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5 (1976), No. 1, 83-89.
16. [FT87] M. L. Fredman, R. E. Taxjan. Fibonacci heaps and their uses in improved network optimization algorithms. In JACM 34 (1987), 596-615.
17. [G85] H. N. Gabow. A scaling algorithm for weighted matching on general graphs. In Proc. FOCS 1985, 90-99.
18. [G85b] H. N. Gabow. Scaling algorithms for network problems. J. Comput. System Sci. 31 (1985), No. 2, 148-168.
19. [GT89] H. Gabow, R. E. Tarjan. Faster scaling algorithms for network problems. SIAM J. Comput. 18 (1989), No. 5, 1013-1036.
20. [GM97] Z. Galil, O. Margalit. All pairs shortest paths for graphs with small integer length edges. J. Comput. Sys. Sci. 54 (1997), 243-254.
21. [G01] A. Goldberg. A simple shortest path algorithm with linear average time. Inter Trust Technical Report STAR-TR-01-03, March 2001.
22. [G95] A. Goldberg. Scaling algorithms for the shortest paths problem. SIAM J. Comput. 24 (1995), No. 3, 494-504.
23. [G+80] R. L. Graham, A. C. Yao, F. F. Yao. Information bounds are weak in the shortest distance problem. J. Assoc. Comput. Mach. 27 (1980), No. 3, 428-444.
24. [HagOO] T. Hagerup. Improved shortest paths on the word RAM. In Proc. ICALP 2000, LNCS volume 1853, 61-72.
25. [HK+97] M. R. Henzinger, P. N. Klein, S. Rao, S. Sub-ramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55 (1997), No. 1, 3-23.
26. [HS99] J. Hershberger, S. Suri. An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. on Comput. 28, No. 6, 2215-2256.
27. [K70] L. R. Kerr. The effect of algebraic structure on the computational complexity of matrix multiplications. Ph.D. Thesis, Cornell University, Ithaca, N.Y., 1970.
28. [KKP93] D. R. Karger, D. Roller, S. J. Phillips. Finding the hidden path: time bounds for all-pairs shortest paths. SIAM J. on Comput. 22 (1993), No. 6, 1199-1217.
29. [KS93] P. N. Klein, S. Sairam. A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs. In Proc. WADS 1993, LNCS 709, 442-451.
30. [L96] H, La Poutre. Lower bounds for the union-find and the split-find problem on pointer machines. J. Comput. and Syst. Sci. 52 (1996), No. 1, 87-99.
31. [PR00] S. Pettie, V. Ramachandran. An optimal minimum spanning tree algorithm. In Proc. ICALP 2000, LNCS volume 1853, 49-60.
32. [PR01] S. Pettie, V. Ramachandran. Computing undirected shortest paths using comparisons and additions. Tech. report TR-01-12, Dept. of Comp. Sci., UT-Austin, 2001.
33. [PROla] S. Pettie, V. Ramachandran. Experimental evaluation of a new shortest path algorithm. Tech. report TR-01-37, Dept. of Comp. Sci., UT-Austin, 2001.
34. [Ram96] R. Raman. Priority queues: small monotone, and trans-dichotomous. In Proc. Euro. Symp. on Alg. 1996, 121-137.
35. [Ram97] R. Raman. Recent results on the single-source shortest paths problem. SIGACT News 28 (1997), 81-87.
36. [S95] R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Sys. Sci., Vol. 51 (1995), 400-403.
37. A. Shoshan, U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proc. FOCS 1999, 605-614.
38. [SP73] P. M. Spira, A. Pan. On finding and updating shortest paths and spanning trees. In Proc. Symp. Switching and Automata Theory 1973, 82-84.
39. [SR94] J. A. Storer, J. H. Reif. Shortest paths in the plane with polygonal obstacles. J. Assoc. Comput. Much. 41 (1994), No. 5, 982-1012.
40. [Tak92] T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett. 43 (1992), No. 4, 195-199.
41. [Tar79] R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. Syst. Sci. 18 (1979), No. 2, 110-127.
42. [Tho96] M. Thorup. On RAM priority queues. In Proc. SODA 1996, 59-67.
43. [Tho99] M. Thorup. Undirected single source shortest paths with positive integer weights in linear time. J. Assoc. Comput. Mach. 46 (1999), No. 3, 362-394.
44. [ThoOl] M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. In Proc. FOCS 2001.
45. [Z98] U. Zwick. All pairs shortest paths in weighted directed graphs -exact and almost exact algorithms. Proc. FOCS'98 (1998), 310-319.