Speeding up dynamic shortest-path algorithms

INFORMS Journal on Computing

Volumn 20, Issue 2, 2008, Pages 191-204

  Buriol, Luciana S ^a   Resende, Mauricio G C ^b   Thorup, Mikkel ^b  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Dijkstra's algorithm; Dynamic shortest path algorithms; Graphs; Heaps; Shortest path algorithms; Trees

Indexed keywords

EID: 61349196141     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1070.0231     Document Type: Article

References (21)

1. Buriol, L. S., M. G. C. Resende, C. C. Ribeiro, M. Thorup. 2005. A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46 36-56.
2. Cherkassky, B. V., A. V. Goldberg, T. Radzik. 1996. Shortest paths algorithms: Theory and experimental evaluation. Math. Programming 73 129-174.
3. Demetrescu, C. 2001. Fully dynamic algorithms for path problems on directed graphs. PhD thesis, Department of Computer and Systems Science, University of Rome "La Sapienza," Rome.
4. Demetrescu, C, G. F. Italiano. 2001, Fully dynamic all pairs shortest with real edge weights. Proc. 42nd Annual Sympos. Foundations Comput. Sci. (FOCS 2001). IEEE Computer Society Washington, D.C., 260-267.
5. Demetrescu, C, G. F. Italiano. 2003. A new approach to dynamic all pairs shortest paths. Proc. 35th Annual ACM Sympos. Theory Comput. (STOC'03). ACM Press, New York, 159-166.
6. Demetrescu, C, S. Emiliozzi, G. Italiano. 2003. Experimental analysis of dynamic all pairs shortest path algorithms. Technical report, Dipartimento di Informatica e Sistemistica, University of Rome "La Sapienza," Rome.
7. Demetrescu, C, D. Frigioni, A. Marchetti-Spaccamela, U. Nanni. 2000. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. Proc. Algorithm Engrg.: 4th Intermit. Workshop, WAE 2000, Saarbrücken, Germany. S. Näher, D. Wagner, eds. Lecture Notes Compu. Sci., Vol. 1982. Springer, Berlin, 218-229.
8. Dionne, R. 1978. Etude et extension d'un algorithme de Murchland. INFOR 16 132-146.
9. Even, S., Y. Shiloach. 1981. An on-line edge-deletion problem. J. ACM 28 1-4.
10. Fortz, B., M. Thorup. 2004. Increasing internet capacity using local search. Comput. Optim. Appl. 29 13-48.
11. Frigioni, D., A. Marchetti-Spaccamela, U. Nanni. 1996. Fully dynamic output bounded single source shortest path problem. Proc. 7th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA). SLAM, Philadelphia, 212-221.
12. Frigioni, D., A. Marchetti-Spaccamela, U. Nanni. 1998. Semi- dynamic algorithms for maintaining single-source shortest path trees. Algorithmica 22 250-274.
13. Frigioni, D., A. Marchetti-Spaccamela, U. Nanni. 2000. Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms 34 351-381.
14. Frigioni, D., M. Ioffreda, U. Nanni, G. Pasqualone. 1998. Experimental analysis of dynamic algorithms for the single source shortest path problem. ACM J. Experiment. Algorithmics 3 Article 5, 1-20.
15. Fujishige, S. 1981. A note on the problem of updating shortest paths. Networks 11 317-319.
16. Gallo, G. 1980. Reoptimization procedures in shortest path problems. Rivista di Matematica per le Scienze Economiche e Sociali 3 3-13.
17. Goto, S., A. Sangiovanni-Vincentelli. 1978. A new shortest path updating algorithm. Networks 8 341-372.
18. King, V, M. Thorup. 2001. A space saving trick for directed dynamic transitive closure and shortest path algorithms. Proc. 7th Annual Internat. Comput. Combin. Conf. (COCOON). Lecture Notes Comput. Sci., Vol. 2108. Springer Verlag Italia, Milano, Italy, 268-277.
19. Murchland, J. D. 1970. A fixed matrix method for all shortest distances in a directed graph and for the inverse problem. PhD thesis, University of Karlsruhe, Karlsruhe, Germany.
20. Ramalingam, G., T. Reps. 1996a. An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21 267-305.
21. Ramalingam, G., T. Reps. 1996b. On the computational complexity of dynamic graph problems. Theoret. Comput. Sci. 158 233-277.