Brief Announcement: Distributed 3/2-Approximation of the Diameter

S Holzer, David Peleg, L Roditty, R Wattenhofer

Research output: Contribution to journalConference articlepeer-review

Abstract

We present an algorithm to 3/2-approximate the diameter of a network in time O(root n log n+D) in the CONGESTmodel. We achieve this by combining results of [2,6] with ideas from [7]. This solution is a factor root log n 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 + epsilon)-approximation to the diameter in time O(root(n/(De)) log n+ D). This essentially matches the Omega(root(n/D)epsilon+D) lower bound for (3/2 - epsilon)-approximating the diameter [1].
Original languageEnglish
Pages (from-to)562-564
Number of pages3
JournalDISTRIBUTED COMPUTING (DISC 2014)
Volume8784
StatePublished - 2014
Event28th International Symposium on Distributed Computing - Austin, TX
Duration: 12 Oct 201415 Oct 2014

Fingerprint

Dive into the research topics of 'Brief Announcement: Distributed 3/2-Approximation of the Diameter'. Together they form a unique fingerprint.

Cite this