@inproceedings{efeaf97c79384c5d839b5f1a973f8c86,
title = "Distributed Dominating Sets in Interval Graphs",
abstract = "The Minimum Dominating Set (MMDS) and Minimum Connected Dominating set (MMCDS) problems are well-studied in the distributed communities due to their numerous applications across the field. These problems are also crucial in wireless ad hoc networks, mainly for the particular type of geometric graphs. We study these problems in geometric graphs such as interval and unit interval graphs. We exploit the underlying geometric structures of these graph classes and present either constant factors distributed algorithms in constant rounds or algorithms with matching lower bounds in the LOCAL communication model.",
keywords = "Approximation algorithms, Distributed algorithms, Interval graphs, Minimum connected dominating set, Minimum dominating set",
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.; 28th International Conference on Computing and Combinatorics, COCOON 2022 ; Conference date: 22-10-2022 Through 24-10-2022",
year = "2022",
month = jan,
day = "1",
doi = "10.1007/978-3-031-22105-7\_45",
language = "English",
isbn = "9783031221040",
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 = "508--520",
editor = "Yong Zhang and Dongjing Miao and Rolf M{\"o}hring",
booktitle = "Computing and Combinatorics - 28th International Conference, COCOON 2022, Proceedings",
address = "Germany",
}