@inproceedings{3b713320249f40bda8896d74bf382a2e,

title = "Constant-Round Near-Optimal Spanners in Congested Clique",

abstract = "Graph spanners have been extensively studied in the literature of graph algorithms. In an undirected weighted graph G = (V, E,ω) on n vertices, a t-spanner of G is a subgraph that preserves pairwise distances up to a multiplicative stretch factor of t . It is well-known that, for any integer k, a (2k - 1)-spanner with O(n1+1/k ) edges always exists, and the stretch-sparsity balance is tight under the girth conjecture by Erdos. In this paper, we are interested in efficient algorithms for spanners in the distributed setting. Specifically, we present constant-round congested clique algorithms for spanners with nearly optimal stretch-sparsity trade-offs: (2k-1)-spanners with O(n1+1/k ) edges in unweighted graphs (i.e. ω 1). (1 + ) (2k - 1)-spanners with O(n1+1/k ) edges in weighted graphs. (2k-1)-spanners withO(kn1+1/k ) edges in weighted graphs.",

keywords = "congested clique, shortest paths, spanners",

author = "Shiri Chechik and Tianyi Zhang",

note = "Publisher Copyright: {\textcopyright} 2022 ACM.; null ; Conference date: 25-07-2022 Through 29-07-2022",

year = "2022",

month = jul,

day = "20",

doi = "10.1145/3519270.3538439",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "325--334",

booktitle = "PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing",

}