A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths
2020
Symposium on Theoretical Aspects of Computer Science
Computing all-pairs shortest paths is a fundamental and much-studied problem with many applications. Unfortunately, despite intense study, there are still no significantly faster algorithms for it than the 𝒪(n³) time algorithm due to Floyd and Warshall (1962). Somewhat faster algorithms exist for the vertex-weighted version if fast matrix multiplication may be used. Yuster (SODA 2009) gave an algorithm running in time 𝒪(n^2.842), but no combinatorial, truly subcubic algorithm is known.
doi:10.4230/lipics.stacs.2020.38
dblp:conf/stacs/KratschN20
fatcat:qdig6y67mfddrerr5qjbid46fq