Fast Approximate Shortest Paths in the Congested Clique

Keren Censor Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf. Fast Approximate Shortest Paths in the Congested Clique. In Peter Robinson 0002, Faith Ellen, editors, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. pages 74-83, ACM, 2019. [doi]

Abstract

Abstract is missing.