Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study

A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully-dynamic batch algorithms for single-source shortest paths in directed graphs with positive edge weights. We give an extensive experimental study of the existing algorithms for the single-edge and the batch case, including a broad set of test instances. We further present tuned variants of the already existing SWSF-FP -algorithm being up to 15 times faster than SWSF-FP . A surprising outcome of the paper is the astonishing level of data dependency of the algorithms. More detailed descriptions and further experimental results of this work can be found in [1].

[1]  Mikkel Thorup,et al.  Speeding Up Dynamic Shortest-Path Algorithms , 2008, INFORMS J. Comput..

[2]  Walter Didimo,et al.  Universit a Degli Studi Di Roma \la Sapienza" Fully Dynamic Algorithms for Path Problems on Directed Graphs Fully Dynamic Algorithms for Path Problems on Directed Graphs , 2001 .

[3]  Daniele Frigioni,et al.  Dynamic Multi-level Overlay Graphs for Shortest Paths , 2008, Math. Comput. Sci..

[4]  Giuseppe F. Italiano,et al.  Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures , 2006, J. Discrete Algorithms.

[5]  Dorothea Wagner,et al.  Landmark-Based Routing in Dynamic Graphs , 2007, WEA.

[6]  Toshimasa Watanabe,et al.  Performance Comparison of Algorithms for the Dynamic Shortest Path Problem , 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[7]  Daniele Frigioni,et al.  Experimental analysis of dynamic algorithms for the single source shortest paths problem , 1998, JEAL.

[8]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[9]  Daniele Frigioni,et al.  Fully dynamic shortest paths in digraphs with arbitrary arc weights , 2003, J. Algorithms.

[10]  Dorothea Wagner,et al.  Experimental study of speed up techniques for timetable information systems , 2011, Networks.

[11]  Mikkel Thorup,et al.  A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms , 2001, COCOON.

[12]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[13]  Dorothea Wagner,et al.  Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures [result from a Dagstuhl seminar] , 2007, Algorithms for Sensor and Ad Hoc Networks.

[14]  Daniel Delling,et al.  SHARC: Fast and robust unidirectional routing , 2008, JEAL.

[15]  Daniel Delling,et al.  Time-Dependent SHARC-Routing , 2008, Algorithmica.

[16]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[17]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[18]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.

[19]  Dorothea Wagner,et al.  14. Experimental Study on Speed-Up Techniques for Timetable Information Systems , 2007 .