Distributed connected dominating sets in unit square and disk graphs

DOI10.1007/978-3-031-20350-3_28MaRDI QIDQ6111972zbMATH OpenOpenAlexFDO

Authors Barun Gorain, Kaushik Mondal, Supantha Pandit

Publication date 4 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20350-3_28

zbMATH Keywords

approximation algorithmsdistributed algorithmsminimum connected dominating setunit disk graphsminimum dominating setaxis-parallel unit square graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
• Distributed Computing: A Locality-Sensitive Approach
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• Planar Formulae and Their Uses
• Simple heuristics for unit disk graphs
• Unit disk graphs

This page was built for publication: Distributed connected dominating sets in unit square and disk graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6111972)