Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 362-371

  Demetrescu, Camil ^a   Emiliozzi, Stefano ^a   Italiano, Giuseppe F ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER NETWORKS; DATABASE SYSTEMS; GRAPH THEORY; PROBLEM SOLVING; ROUTERS;

MEMORY BANDWIDTH; REAL-VALUE EDGE WEIGHTS; SHORTEST PATH PROBLEM;

ALGORITHMS;

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

References (27)

1. D. Alberts, G. Cattaneo, and G.F. Italiano. An empirical study of dynamic graph algorithms. ACM Journal on Experimental Algorithmics, 2(5), 1997.
2. G. Amato, G. Cattaneo, and G.F. Italiano. Experimental analysis of dynamic minimum spanning tree algorithms. In Proc. SODA'97, pages 314-323, 1997.
3. Cattaneo, G. and Faruolo, P. and Ferraro-Petrillo, U. and Italiano, G. F. Maintaining dynamic minimum spanning trees: An experimental study. In Proc. ALENEX'02, 2002.
4. B.V. Cherkassky, A.V. Goldberg, and T. Radzik. Shortest paths algorithms: Theory and experimental evaluation. Math. Programming, 73:129-174, 1996.
5. C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proceedings WAE'00, 2000.
6. C. Demetrescu and G.F. Italiano. Fully dynamic all pairs shortest paths with real edge weights. In Proc. FOCS'01, pages 260-267, 2001.
7. C. Demetrescu and G.F. Italiano. A new approach to dynamic all pairs shortest paths. In Proceedings of STOC'03, pages 159-166, 2003.
8. E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Math., 1:269-271, 1959.
9. S. Even and Y. Shiloach. An on-line edge-deletion problem. Journal of the ACM, 28:1-4, 1981.
10. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings INFOCOM'00, pages 519-528, 2000.
11. M.L. Fredman and R.E. Tarjan. Fibonacci heaps and their use in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
12. D. Frigioni, M. Ioffreda, U. Nanni, and G. Pasqualone. Analysis of dynamic algorithms for the single source shortest path problem. ACM JEA, 3, 1998.
13. D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Shaefer, and C.D. Zaroliagis. An experimental study of dynamic algorithms for directed graphs. In Proc. ESA'98, pages 320-331, 1998.
14. A.V. Goldberg. Shortest path algorithms: Engineering aspects. In Proc. ISAAC'01, 2001.
15. D. H. Greene and D.E. Knuth. Mathematics for the analysis of algorithms. Birkhäuser, 1982.
16. R. Iyer, D. R. Karger, H. S. Rahul, and M. Thorup. An experimental study of poly-logarithmic fully-dynamic connectivity algorithms. In B.E. Moret and A.V. Goldberg, editors, Proc. ALENEX'00, 2000.
17. D. Karger, D. Koller, and S.J. Phillips. Finding the hidden path: Time bounds for all-pairs shortest paths. SIAM Journal on Computing, 22(6):1199-1217, 1993.
18. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. FOCS'99, pages 81-99, 1999.
19. V. King and M. Thorup. A space saving trick for directed dynamic transitive closure and shortest path algorithms. In Proc. COCOON'01, pp. 268-277, 2001.
20. P. Loubal. A network evaluation procedure. Highway Research Record 205, pages 96-109, 1967.
21. J. Murchland. The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph. Technical report, LBS-TNT-26, London Business School, Transport Network Theory Unit, 1967.
22. Paolo Narvaez, Kai-Yeung Siu, and Hong-Yi Tzeng. New dynamic algorithms for shortest path tree computation. IEEE/ACM Transactions on Networking, 8:734-746, 2000.
23. Paolo Narvaez, Kai-Yeung Siu, and Hong-Yi Tzeng. New dynamic SPT algorithm based on a ball-and-string model. IEEE/ACM Transactions on Networking, 9:706-718, 2001.
24. G. Ramalingam. Bounded incremental computation. In Lecture Notes in Computer Science 1089, 1996.
25. G. Ramalingam and T. Reps. An incremental algorithm for a generalization of the shortest path problem. Journal of Algorithms, 21:267-305, 1996.
26. J. Seward and N. Nethercote. Valgrind, an open-source memory debugger for x86-gnu/linux. URL: http://developer.kde.org/~sewardj/.
27. F. Zhan and C. Noon. Shortest path algorithms: An evaluation using real road networks. Transportation Science, 32(1):65-73, 1998.