Abstract
AbstractThe 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 \(\mathcal {LOCAL}\) communication model.KeywordsMinimum dominating setMinimum connected dominating setDistributed algorithmsInterval graphsApproximation algorithms
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call