TY - GEN
T1 - Distributed construction of purely additive spanners
AU - Censor-Hillel, Keren
AU - Kavitha, Telikepalli
AU - Paz, Ami
AU - Yehudayoff, Amir
N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2016.
PY - 2016
Y1 - 2016
N2 - This paper studies the complexity of distributed construction of purely additive spanners in the CONGEST model. We describe algorithms for building such spanners in several cases. Because of the need to simultaneously make decisions at far apart locations, the algorithms use additional mechanisms compared to their sequential counterparts. We complement our algorithms with a lower bound on the number of rounds required for computing pairwise spanners. The standard reductions from set-disjointness and equality seem unsuitable for this task because no specific edge needs to be removed from the graph. Instead, to obtain our lower bound, we define a new communication complexity problem that reduces to computing a sparse spanner, and prove a lower bound on its communication complexity using information theory. This technique significantly extends the current toolbox used for obtaining lower bounds for the CONGEST model, and we believe it may find additional applications.
AB - This paper studies the complexity of distributed construction of purely additive spanners in the CONGEST model. We describe algorithms for building such spanners in several cases. Because of the need to simultaneously make decisions at far apart locations, the algorithms use additional mechanisms compared to their sequential counterparts. We complement our algorithms with a lower bound on the number of rounds required for computing pairwise spanners. The standard reductions from set-disjointness and equality seem unsuitable for this task because no specific edge needs to be removed from the graph. Instead, to obtain our lower bound, we define a new communication complexity problem that reduces to computing a sparse spanner, and prove a lower bound on its communication complexity using information theory. This technique significantly extends the current toolbox used for obtaining lower bounds for the CONGEST model, and we believe it may find additional applications.
UR - http://www.scopus.com/inward/record.url?scp=84988603151&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-662-53426-7_10
DO - https://doi.org/10.1007/978-3-662-53426-7_10
M3 - منشور من مؤتمر
SN - 9783662534250
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 129
EP - 142
BT - Distributed Computing - 30th International Symposium, DISC 2016, Proceedings
A2 - Gavoille, Cyril
A2 - Ilcinkas, David
T2 - 30th International Symposium on Distributed Computing, DISC 2016
Y2 - 27 September 2016 through 29 September 2016
ER -