Abstract
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 language | English |
|---|---|
| Title of host publication | Distributed Computing - 28th International Symposium, DISC 2014, Proceedings |
| Editors | Fabian Kuhn |
| Publisher | Springer Verlag |
| Pages | 562-564 |
| Number of pages | 3 |
| ISBN (Electronic) | 9783662451731 |
| State | Published - 2014 |
| Event | 28th International Symposium on Distributed Computing, DISC 2014 - Austin, United States Duration: 12 Oct 2014 → 15 Oct 2014 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 8784 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 28th International Symposium on Distributed Computing, DISC 2014 |
|---|---|
| Country/Territory | United States |
| City | Austin |
| Period | 12/10/14 → 15/10/14 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2014.