Fast Approximate Shortest Paths in the Congested Clique

DOI10.1145/3293611.3331633OpenAlexW2963015907MaRDI 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

zbMATH Keywords

diameterdistributed computingapproximation algorithmsmatrix multiplicationcongested cliquesingle-source shortest pathshopsetsall-pairs shortest paths

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (7)

Single-source shortest paths in the CONGEST model with improved bounds ⋮ Near-optimal clustering in the \(k\)-machine model ⋮ Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time ⋮ Near-optimal scheduling in the congested clique

This page was built for publication: Fast Approximate Shortest Paths in the Congested Clique