{"oa_version":"Preprint","date_updated":"2024-03-07T14:43:38Z","external_id":{"isi":["000570442000011"],"arxiv":["1903.05956"]},"status":"public","author":[{"first_name":"Keren","last_name":"Censor-Hillel","full_name":"Censor-Hillel, Keren"},{"full_name":"Dory, Michal","first_name":"Michal","last_name":"Dory"},{"full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","last_name":"Korhonen"},{"full_name":"Leitersdorf, Dean","first_name":"Dean","last_name":"Leitersdorf"}],"conference":{"name":"PODC: Symposium on Principles of Distributed Computing","end_date":"2019-08-02","start_date":"2019-07-29","location":"Toronto, ON, Canada"},"type":"conference","page":"74-83","doi":"10.1145/3293611.3331633","citation":{"ista":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed Computing, 74–83.","apa":"Censor-Hillel, K., Dory, M., Korhonen, J., &#38; Leitersdorf, D. (2019). Fast approximate shortest paths in the congested clique. In <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i> (pp. 74–83). Toronto, ON, Canada: ACM. <a href=\"https://doi.org/10.1145/3293611.3331633\">https://doi.org/10.1145/3293611.3331633</a>","chicago":"Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” In <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i>, 74–83. ACM, 2019. <a href=\"https://doi.org/10.1145/3293611.3331633\">https://doi.org/10.1145/3293611.3331633</a>.","ama":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. In: <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i>. ACM; 2019:74-83. doi:<a href=\"https://doi.org/10.1145/3293611.3331633\">10.1145/3293611.3331633</a>","ieee":"K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” in <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i>, Toronto, ON, Canada, 2019, pp. 74–83.","short":"K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.","mla":"Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i>, ACM, 2019, pp. 74–83, doi:<a href=\"https://doi.org/10.1145/3293611.3331633\">10.1145/3293611.3331633</a>."},"date_published":"2019-08-01T00:00:00Z","quality_controlled":"1","related_material":{"record":[{"relation":"later_version","status":"public","id":"7939"}]},"title":"Fast approximate shortest paths in the congested clique","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.05956"}],"publication_identifier":{"isbn":["9781450362177"]},"month":"08","year":"2019","abstract":[{"text":"We design fast deterministic algorithms for distance computation in the CONGESTED CLIQUE model. Our key contributions include:\r\n\r\n - A (2+ε)-approximation for all-pairs shortest paths problem in O(log²n / ε) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\r\n - A (1+ε)-approximation for multi-source shortest paths problem from O(√n) sources in O(log² n / ε) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in Õ(n^{1/6}) rounds.","lang":"eng"}],"date_created":"2019-10-08T12:48:42Z","publication_status":"published","language":[{"iso":"eng"}],"publication":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin","oa":1,"_id":"6933","scopus_import":"1","publisher":"ACM","day":"01","department":[{"_id":"DaAl"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No"}