Fast Approximate Shortest Paths in the Congested Clique

03/14/2019
by   Keren Censor-Hillel, et al.
0

We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A (2+ϵ)-approximation for all-pairs shortest paths in O(^2n / ϵ) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model. -- A (1+ϵ)-approximation for multi-source shortest paths from O(√(n)) sources in O(^2n / ϵ) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size. Our main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in Õ(n^1/6) rounds.

READ FULL TEXT
research
04/15/2018

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n^3/2) Rounds

We present a deterministic distributed algorithm to compute all-pairs sh...
research
03/06/2020

Exponentially Faster Shortest Paths in the Congested Clique

We present improved deterministic algorithms for approximating shortest ...
research
07/18/2023

Fast 2-Approximate All-Pairs Shortest Paths

In this paper, we revisit the classic approximate All-Pairs Shortest Pat...
research
07/28/2021

(1+ε)-Approximate Shortest Paths in Dynamic Streams

Computing approximate shortest paths in the dynamic streaming setting is...
research
05/30/2022

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs

We consider global problems, i.e. problems that take at least diameter t...
research
10/26/2020

Distance Computations in the Hybrid Network Model via Oracle Simulations

The Hybrid network model was introduced in [Augustine et al., SODA '20] ...
research
04/16/2020

Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication

Consider an undirected weighted graph G = (V,E,w). We study the problem ...

Please sign up or login with your details

Forgot password? Click here to reset