Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^{5/4}) Rounds

2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 168-179, 2017.

Cited by: 26|Bibtex|Views29|DOI:https://doi.org/10.1109/FOCS.2017.24
Other Links: academic.microsoft.com

Abstract:

We study computing all-pairs shortest paths (APSP) on distributed networks (the CONGEST model). The goal is for every node in the (weighted) network to know the distance from every other node using communication. The problem admits (1+ o(1))-approximation (O) over tilde (n)-time algorithms [2], [3], which are matched with (Omega) over til...More

Code:

Data:

Your rating :
0

 

Tags
Comments