Distributed connected dominating sets in unit square and disk graphs
From MaRDI portal
Publication:6111972
DOI10.1007/978-3-031-20350-3_28OpenAlexW4313349320MaRDI QIDQ6111972
Kaushik Mondal, Supantha Pandit, Barun Gorain
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
approximation algorithmsdistributed algorithmsminimum connected dominating setunit disk graphsminimum dominating setaxis-parallel unit square graphs
Cites Work
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Unit disk graphs
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Planar Formulae and Their Uses
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Distributed Computing: A Locality-Sensitive Approach
- Simple heuristics for unit disk graphs
This page was built for publication: Distributed connected dominating sets in unit square and disk graphs