Work

All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication

Year: 2000
Type: preprint
Abstract: The second algorithm solves the APSP problem almost exactly for directed graphs with arbitrary non-negative real weights. The algorithm runs in ~O((n!=ffl) log(W=ffl)) time, where ffl? 0 is an error parameter and W is the largest edge weight in the graph, after the edge weights are scaled so that the smallest non-zero edge weight in the graph is 1. It returns estimates of all the distances in the graph with a stretch of at most 1 + ffl. Corresponding paths can also be found efficiently.
Author: Uri Zwick
Institution: Tel Aviv University
Language: English
Open Access status: green
OpenAlex ID: W2950713230
Cites: 28
Cited by: 3
Related to: 10