Distributed construction of purely additive spanners

Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationDistributed Computing - 30th International Symposium, DISC 2016, Proceedings
EditorsCyril Gavoille, David Ilcinkas
Number of pages14
StatePublished - 2016
Event30th International Symposium on Distributed Computing, DISC 2016 - Paris, France
Duration: 27 Sep 201629 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9888 LNCS


Conference30th International Symposium on Distributed Computing, DISC 2016

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Distributed construction of purely additive spanners'. Together they form a unique fingerprint.

Cite this