Fast Approximate Shortest Paths in the Congested Clique
From MaRDI portal
Publication:5145183
DOI10.1145/3293611.3331633MaRDI QIDQ5145183
Michal Dory, Janne H. Korhonen, Keren Censor-Hillel, 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
diameter; distributed computing; approximation algorithms; matrix multiplication; congested clique; single-source shortest paths; hopsets; all-pairs shortest paths
Related Items
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models, Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time, Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE, Near-optimal clustering in the \(k\)-machine model, Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC, Near-optimal scheduling in the congested clique, Single-source shortest paths in the CONGEST model with improved bounds