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 language | English |
|---|---|
| Pages (from-to) | 562-564 |
| Number of pages | 3 |
| Journal | DISTRIBUTED COMPUTING (DISC 2014) |
| Volume | 8784 |
| State | Published - 2014 |
| Event | 28th International Symposium on Distributed Computing - Austin, TX Duration: 12 Oct 2014 → 15 Oct 2014 |