Distributed Exact Weighted AllPairs Shortest Paths in NearLinear Time
Abstract
In the {\em distributed allpairs shortest paths} problem (APSP), every node in the weighted undirected distributed network (the CONGEST model) needs to know the distance from every other node using least number of communication rounds (typically called {\em time complexity}). The problem admits $(1+o(1))$approximation $\tilde\Theta(n)$time algorithm and a nearlytight $\tilde \Omega(n)$ lower bound [Nanongkai, STOC'14; Lenzen and PattShamir PODC'15]\footnote{$\tilde \Theta$, $\tilde O$ and $\tilde \Omega$ hide polylogarithmic factors. Note that the lower bounds also hold even in the unweighted case and in the weighted case with polynomial approximation ratios~\cite{LenzenP_podc13,HolzerW12,PelegRT12,NanongkaiSTOC14}.}. For the exact case, Elkin [STOC'17] presented an $O(n^{5/3} \log^{2/3} n)$ time bound, which was later improved to $\tilde O(n^{5/4})$ [Huang, Nanongkai, Saranurak FOCS'17]. It was shown that any superlinear lower bound (in $n$) requires a new technique [CensorHillel, Khoury, Paz, DISC'17], but otherwise it remained widely open whether there exists a $\tilde O(n)$time algorithm for the exact case, which would match the best possible approximation algorithm. This paper resolves this question positively: we present a randomized (Las Vegas) $\tilde O(n)$time algorithm, matching the lower bound up to polylogarithmic factors. Like the previous $\tilde O(n^{5/4})$ bound, our result works for directed graphs with zero (and even negative) edge weights. In addition to the improved running time, our algorithm works in a more general setting than that required by the previous $\tilde O(n^{5/4})$ bound; in our setting (i) the communication is only along edge directions (as opposed to bidirectional), and (ii) edge weights are arbitrary (as opposed to integers in {1, 2, ... poly(n)}). ...
 Publication:

arXiv eprints
 Pub Date:
 November 2018
 DOI:
 10.48550/arXiv.1811.03337
 arXiv:
 arXiv:1811.03337
 Bibcode:
 2018arXiv181103337B
 Keywords:

 Computer Science  Distributed;
 Parallel;
 and Cluster Computing;
 Computer Science  Data Structures and Algorithms;
 C.2.4;
 F.2.0;
 G.2.2
 EPrint:
 Full version of STOC 2019