@inproceedings{2eef1b6d49ec472ca620b5a82f089557,
title = "Brief announcement: Distributed 3/2-approximation of the diameter",
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].",
author = "Stephan Holzer and David Peleg and Liam Roditty and Roger Wattenhofer",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2014.; 28th International Symposium on Distributed Computing, DISC 2014 ; Conference date: 12-10-2014 Through 15-10-2014",
year = "2014",
language = "الإنجليزيّة",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "562--564",
editor = "Fabian Kuhn",
booktitle = "Distributed Computing - 28th International Symposium, DISC 2014, Proceedings",
address = "ألمانيا",
}