For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph is contained in the subset or has a neighbor in the subset. A unit disk graph is a graph in which each vertex corresponds to a unit disk in the plane and two vertices are adjacent if and only if their disks have a non-empty intersection. We present the first constant-factor approximation algorithm for the minimum-weight dominating set problem in unit disk graphs, a problem motivated by applications in wireless ad-hoc networks. The algorithm is obtained in two steps: First, the problem is reduced to the problem of covering a set of points located in a small square using a minimumweight set of unit disks. Then, a constant-factor approximation algorithm for the latter problem is obtained using enumeration and dynamic programming techniques exploiting the geometry of unit disks. Furthermore, we show how to obtain a constant-factor approximation algorithm for the minimum-weight connected dominating set problem in unit disk graphs. Our techniques also yield a constant-factor approximation algorithm for the weighted disk cover problem (covering a set of points in the plane with unit disks of minimum total weight) and a 3-approximation algorithm for the weighted forwarding set problem (covering a set of points in the plane with weighted unit disks whose centers are all contained in a given unit disk).
The first constant-approximation algorithm for the weighted (1, 1)-CDS problem in unit disk graphs was due to Ambühl et al. REF .
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
In: Proc. of the 9 th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). (2006
Mathematics Computer Science