On connected domination in unit ball graphs
From MaRDI portal
Publication:537633
DOI10.1007/S11590-010-0211-0zbMATH Open1220.90148OpenAlexW1987607815MaRDI QIDQ537633FDOQ537633
Authors: Sera Kahruman-Anderoglu, Oleksii Ursulenko, Sergiy Butenko 
Publication date: 20 May 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0211-0
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- Unit disk graphs
- Unit disk graph recognition is NP-hard
- Title not available (Why is that?)
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Approximation algorithms for connected dominating sets
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Improved bottleneck domination algorithms
Cited In (20)
- Good Quality Virtual Realization of Unit Ball Graphs
- Linear separation of connected dominating sets in graphs
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Connected dominating set. Theory and applications
- On dominating sets whose induced subgraphs have a bounded diameter
- Online dominating set and coloring
- Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
- Title not available (Why is that?)
- On connected dominating sets of restricted diameter
- A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks
- Bounds on the domination number of a digraph
- The algorithm and complexity of co-secure domination in geometric intersection graphs
- On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks
- A distributed approximation algorithm for the bottleneck connected dominating set problem
- Wireless networking, dominating and packing
- On approximation of dominating tree in wireless sensor networks
- A survey on variant domination problems in geometric intersection graphs
- A PTAS for weak minimum routing cost connected dominating set of unit disk graph
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs
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)
