Distributed exact weighted all-pairs shortest paths in near-linear time

  title={Distributed exact weighted all-pairs shortest paths in near-linear time},
  author={Aaron Bernstein and Danupon Nanongkai},
  journal={Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
  • A. BernsteinDanupon Nanongkai
  • Published 8 November 2018
  • Computer Science
  • Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
In the distributed all-pairs 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 time complexity). The problem admits (1+o(1))-approximation Θ(n)-time algorithm and a nearly-tight Ω(n) lower bound [Nanongkai, STOC’14; Lenzen and Patt-Shamir PODC’15]. For the exact case, Elkin [STOC’17] presented an O(n5/3 log2/3 n) time bound… 

Distributed Exact Shortest Paths in Sublinear Time

This article provides an all-pairs shortest paths algorithm that requires O(n5/3 ⋅ log 2/3 n) time, even for b = 1, for all values of D, and devise the first algorithm with non-trivial complexity guarantees for computing exact shortest paths in the multipass semi-streaming model of computation.

Faster Deterministic All Pairs Shortest Paths in Congest Model

A new deterministic algorithm for distributed weighted all pairs shortest paths (APSP) in both undirected and directed graphs is presented, which significantly improves on the deterministic blocker set algorithms in [ARKP18, AR19] by removing an additional n ·|Q| term in the round bound.

Distributed Weighted All Pairs Shortest Paths Through Pipelining

The techniques in the results simplify some of the procedures in the earlier APSP algorithms for non-negative edge weights in [HNS17, ARKP18], improving results in [Nanongkai14, LP15] that hold only for positive integer weights.

Distributed edge connectivity in sublinear time

By combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], the network can decompose into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones).

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing

The construction is simple, solely based on low-diameter decompositions, and—in contrast to all known constructions—directly produces an oblivious flow instead of just an approximation of the optimal flow cost.

Universally-optimal distributed algorithms for known topologies

This work provides several (equivalent) graph parameters and shows they are tight universal lower bounds for the above problems, fully characterizing their inherent complexity, and implies that algorithms based on the low-congestion shortcut framework match the above lower bound, making them universally optimal if shortcuts are efficiently approximable.

Undirected (1+𝜀)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms

This paper presents near-optimal deterministic parallel and distributed algorithms for computing (1+eps)-approximate single-source shortest paths in any undirected weighted graph. On a high level, we

16 : 2 A Distributed Algorithm for Directed MinimumWeight Spanning Tree

This paper presents the first sub-quadratic DMST algorithms in the distributed CONGEST network model, where the messages exchanged between the network nodes are bounded in size and uses a distributed single-source shortest-path algorithm for directed graphs as a black box.

Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model

This paper constructs a Õ(n1/4)-round quantum distributed algorithm for the APSP over directed graphs with polynomial weights in the CONGEST-CLIQUE model and shows how to implement multiple quantum searches in parallel without introducing congestions.

Hardness of Distributed Optimization

This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing tildeΩmega (n2) lower



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

This paper presents an Õ(n^{5/4})-time randomized (Las Vegas) algorithm for exact weighted APSP, which provides the first improvement over the naive O(m)-time algorithm when the network is not so sparse.

A deterministic almost-tight distributed algorithm for approximating single-source shortest paths

This work develops a deterministic process that replaces the “hitting set argument” commonly used for shortest paths computation in various settings, and develops a simple, deterministic, construction of an (no(1), o(1))-hop set of size O(n1+o(1)).

Distributed exact shortest paths in sublinear time

An all-pairs shortest paths algorithm that requires O(n5/3 #183; log2/3 n) time, even for b = 1, for all values of D, and provides an improved bound, compared to the unit-bandwidth case.

Distributed approximation algorithms for weighted shortest paths

The time complexity of approximating weighted (undirected) shortest paths on distributed networks with a O (log n) bandwidth restriction on edges is studied to find a sublinear-time algorithm with almost optimal solution.

Near-Optimal Distributed Maximum Flow: Extended Abstract

We present a near-optimal distributed algorithm for (1+o(1))-approximation of single-commodity maximum flow in undirected weighted networks that runs in (D+ √n)⋅ no(1) communication rounds in the

A Faster Distributed Single-Source Shortest Paths Algorithm

Two new randomized algorithms for polynomially bounded integer edge weights in the CONGEST model of distributed computing with non-negative edge weights for single-source shortest paths (SSSP) are devised.

Improved distributed algorithms for exact shortest paths

An alternative single-source shortest path algorithm with complexity Õ(n3/4D1/4) is provided, in which this algorithm provides the fastest algorithm for moderately small r and D, improving on those of Huang et al.

Optimal distributed all pairs shortest paths and applications

A new lower bound for approximating the diameter D of a graph is presented: being allowed to answer D+1 or D can speed up the computation by at most a factor D, and an algorithm is provided that achieves such a speedup of D and computes an (1+εepsilon) multiplicative approximation of the diameter.

A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities

A deterministic algorithm that computes MST in time O((D + √n).

Almost-Tight Distributed Minimum Cut Algorithms

This is the first paper that explicitly studies computing the exact minimum cut in the distributed setting and can compute λ exactly in O(D + n 1/2log* n)-time.