License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2018.29
URN: urn:nbn:de:0030-drops-98181
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9818/
Ghaffari, Mohsen ;
Kuhn, Fabian
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set
Abstract
This paper presents improved deterministic distributed algorithms, with O(log n)-bit messages, for some basic graph problems. The common ingredient in our results is a deterministic distributed algorithm for computing a certain hitting set, which can replace the random part of a number of standard randomized distributed algorithms. This deterministic hitting set algorithm itself is derived using a simple method of conditional expectations. As one main end-result of this derandomized hitting set, we get a deterministic distributed algorithm with round complexity 2^O(sqrt{log n * log log n}) for computing a (2k-1)-spanner of size O~(n^{1+1/k}). This improves considerably on a recent algorithm of Grossman and Parter [DISC'17] which needs O(n^{1/2-1/k} * 2^k) rounds. We also get a 2^O(sqrt{log n * log log n})-round deterministic distributed algorithm for computing an O(log^2 n)-approximation of minimum dominating set; all prior algorithms for this problem were either randomized or required large messages.
BibTeX - Entry
@InProceedings{ghaffari_et_al:LIPIcs:2018:9818,
author = {Mohsen Ghaffari and Fabian Kuhn},
title = {{Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {29:1--29:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Ulrich Schmid and Josef Widder},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9818},
URN = {urn:nbn:de:0030-drops-98181},
doi = {10.4230/LIPIcs.DISC.2018.29},
annote = {Keywords: Distributed Algorithms, Derandomization, Spanners, Dominating Set}
}
Keywords: |
|
Distributed Algorithms, Derandomization, Spanners, Dominating Set |
Collection: |
|
32nd International Symposium on Distributed Computing (DISC 2018) |
Issue Date: |
|
2018 |
Date of publication: |
|
04.10.2018 |