Recommendations
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Approximation algorithms for connected dominating sets
- Approximation algorithms for connected dominating sets
- A better constant-factor approximation for weighted dominating set in unit disk graph
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
Cites work
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Approximation algorithms for connected dominating sets
- Improved bottleneck domination algorithms
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Unit disk graph recognition is NP-hard
- Unit disk graphs
Cited in
(20)- Bounds on the domination number of a digraph
- Linear separation of connected dominating sets in graphs
- A distributed approximation algorithm for the bottleneck connected dominating set problem
- scientific article; zbMATH DE number 6871091 (Why is no real title available?)
- The algorithm and complexity of co-secure domination in geometric intersection graphs
- Connected dominating set. Theory and applications
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs
- On connected dominating sets of restricted diameter
- Good Quality Virtual Realization of Unit Ball Graphs
- Online dominating set and coloring
- Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
- A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks
- A survey on variant domination problems in geometric intersection graphs
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- Wireless networking, dominating and packing
- On approximation of dominating tree in wireless sensor networks
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks
- On dominating sets whose induced subgraphs have a bounded diameter
- A PTAS for weak minimum routing cost connected dominating set of unit disk graph
This page was built for publication: On connected domination in unit ball graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537633)
