Fast Approximate Shortest Paths in the Congested Clique

DOI10.1145/3293611.3331633OpenAlexW2963015907MaRDI QIDQ5145183FDOQ5145183

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

distributed computingapproximation algorithmsdiametermatrix multiplicationcongested cliquesingle-source shortest pathshopsetsall-pairs shortest paths

Mathematics Subject Classification ID

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

Cited In (10)

• 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
• Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
• 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)