Efficient Algorithms for Approximating All-Pairs Shortest Paths in Congested Clique

This paper presents new randomized algorithms for approximating All-Pairs Shortest Paths (APSP) in the Congested Clique model, achieving an O(1)-approximation in O(log log log n) rounds, and providing a trade-off between the number of rounds and the approximation quality.