Fast Approximate Shortest Paths in the Congested Clique
DOI10.1145/3293611.3331633OpenAlexW2963015907MaRDI QIDQ5145183FDOQ5145183
Authors: Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf 
Publication date: 20 January 2021
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.05956
Recommendations
- Fast approximate shortest paths in the congested clique
- Exponentially Faster Shortest Paths in the Congested Clique
- Exponentially Faster Shortest Paths in the Congested Clique
- Approximation of distances and shortest paths in the broadcast congest clique
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
distributed computingapproximation algorithmsdiametermatrix multiplicationcongested cliquesingle-source shortest pathshopsetsall-pairs shortest paths
Cited In (11)
- Congested Clique Algorithms for the Minimum Cut Problem
- Near-optimal scheduling in the congested clique
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Exponentially Faster Shortest Paths in the Congested Clique
- Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE
- Fast distributed algorithms for girth, cycles and small subgraphs
- Single-source shortest paths in the CONGEST model with improved bounds
- Near-optimal clustering in the \(k\)-machine model
- Improved hardness of approximation of diameter in the CONGEST model
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
This page was built for publication: Fast Approximate Shortest Paths in the Congested Clique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145183)
