Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2020.28
URN: urn:nbn:de:0030-drops-135138
URL: https://drops.dagstuhl.de/opus/volltexte/2021/13513/
Censor-Hillel, Keren ; Dafni, Neta ; Kolobov, Victor I. ; Paz, Ami ; Schwartzman, Gregory
Fast Deterministic Algorithms for Highly-Dynamic Networks
| pdf-format: |
|
Abstract
This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which arbitrarily many edge changes may occur in each round. Our algorithm significantly improves upon prior work in its combination of (1) having an O(1) amortized time complexity, (2) using only O(log{n})-bit messages, (3) not posing any restrictions on the dynamic behavior of the environment, (4) being deterministic, (5) having strong guarantees for intermediate solutions, and (6) being applicable for a wide family of tasks.The tasks for which we deduce such an algorithm are maximal matching, (degree+1)-coloring, 2-approximation for minimum weight vertex cover, and maximal independent set (which is the most subtle case). For some of these tasks, node insertions can also be among the allowed topology changes, and for some of them also abrupt node deletions.
BibTeX - Entry
@InProceedings{censorhillel_et_al:LIPIcs:2021:13513,
author = {Keren Censor-Hillel and Neta Dafni and Victor I. Kolobov and Ami Paz and Gregory Schwartzman},
title = {{Fast Deterministic Algorithms for Highly-Dynamic Networks}},
booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-176-4},
ISSN = {1868-8969},
year = {2021},
volume = {184},
editor = {Quentin Bramas and Rotem Oshman and Paolo Romano},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13513},
URN = {urn:nbn:de:0030-drops-135138},
doi = {10.4230/LIPIcs.OPODIS.2020.28},
annote = {Keywords: dynamic distributed algorithms}
}
| Keywords: | dynamic distributed algorithms | |
| Seminar: | 24th International Conference on Principles of Distributed Systems (OPODIS 2020) | |
| Issue date: | 2021 | |
| Date of publication: | 25.01.2021 |
