Brief announcement: Distributed 3/2-approximation of the diameter

Stephan Holzer, David Peleg, Liam Roditty, Roger Wattenhofer

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


We present an algorithm to 3/2-approximate the diameter of a network in time in the CONGESTmodel.We achieve this by combining results of [2,6] with ideas from [7]. This solution is a factor faster than the one achieved in [4] and uses a different approach. Our different approach is of interest as we show how to extend it to compute a (3/2 + ε)-approximation to the diameter in time. This essentially matches the lower bound for (3/2 − ε)-approximating the diameter [1].

Original languageEnglish
Title of host publicationDistributed Computing - 28th International Symposium, DISC 2014, Proceedings
EditorsFabian Kuhn
PublisherSpringer Verlag
Number of pages3
ISBN (Electronic)9783662451731
StatePublished - 2014
Event28th International Symposium on Distributed Computing, DISC 2014 - Austin, United States
Duration: 12 Oct 201415 Oct 2014

Publication series

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


Conference28th International Symposium on Distributed Computing, DISC 2014
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Brief announcement: Distributed 3/2-approximation of the diameter'. Together they form a unique fingerprint.

Cite this