@inproceedings{75ee687fe4074f1d8f8a951f1a2d436b,
title = "Distributed Connected Dominating Sets in Unit Square and Disk Graphs",
abstract = "The Minimum Dominating Set (MDS) and Minimum Connected Dominating set (MCDS) problems are well-studied problems in the distributed computing communities due to their numerous applications across the field. We study these problems in axis-parallel unit square and unit disk graphs. We exploit the underlying geometric structures of these graph classes and present constant round distributed algorithms in the LOCAL communication model. Our results are distributed constant factor approximation algorithms for the MCDS problem in unit square graphs that run in 18 rounds and in unit disk graphs that run in 44 rounds. The message complexity is linear for both the algorithms.",
keywords = "Approximation algorithms, Axis-parallel unit square graphs, Distributed algorithms, Minimum connected dominating set, Minimum dominating set, Unit disk graphs",
author = "Barun Gorain and Kaushik Mondal and Supantha Pandit",
note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 17th Annual Conference on Theory and Applications of Models of Computation, TAMC 2022 ; Conference date: 16-09-2022 Through 18-09-2022",
year = "2022",
month = jan,
day = "1",
doi = "10.1007/978-3-031-20350-3_28",
language = "English",
isbn = "9783031203497",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "346--358",
editor = "Ding-Zhu Du and Donglei Du and Chenchen Wu and Dachuan Xu",
booktitle = "Theory and Applications of Models of Computation - 17th Annual Conference, TAMC 2022, Proceedings",
address = "Germany",
}