New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches
Despite disillusioning worst-case behavior, classic algorithms for single-source shortest-paths (SSSP) like Bellman-Ford are still being used in practice, especially due to their simple data structures. However, surprisingly little is known about the average-case complexity of these approaches. We provide new theoretical and experimental results for the performance of classic label-correcting SSSP algorithms on graph classes with non-negative random edge weights. In particular, we prove a tight lower bound of Ω(n 2) for the running times of Bellman-Ford on a class of sparse graphs with O(n) nodes and edges; the best previous bound was Ω(n 4/3 − ε ). The same improvements are shown for Pallottino’s algorithm. We also lift a lower bound for the approximate bucket implementation of Dijkstra’s algorithm from Ω(n logn / loglogn) to Ω(n 1.2 − ε ). Furthermore, we provide an experimental evaluation of our new graph classes in comparison with previously used test inputs.
KeywordsGraph Class Short Path Algorithm Grid Graph FIFO Queue Bucket Size
Unable to display preview. Download preview PDF.
- 5.Dubhashi, D.P., Panconesi, A.: Concentration of measure for the analysis of randomized algorithms. Draft Manuscript (October 1998), http://www.brics.dk/~ale/papers.html
- 8.Grinstead, C.M., Snell, L.J.: Grinstead and Snell’s Introduction to Probability. American Mathematical Society, Providence (2006) (version dated July 4, 2006 edn.)Google Scholar
- 11.Hedrick, C.L.: Routing Information Protocol, RFC 1058 (1988)Google Scholar