an:05633378
Zbl 1184.05090
Huang, Yaochun; Gao, Xiaofeng; Zhang, Zhao; Wu, Weili
A better constant-factor approximation for weighted dominating set in unit disk graph
EN
J. Comb. Optim. 18, No. 2, 179-194 (2009).
00252774
2009
j
05C69 05C22
wireless network; connected dominating set; unit disk graph
Summary: This paper presents a \((10+\varepsilon)\)-approximation algorithm to compute minimum-weight connected dominating set (MWCDS) in unit disk graph. MWCDS is to select a vertex subset with minimum weight for a given unit disk graph, such that each vertex of the graph is contained in this subset or has a neighbor in this subset. Besides, the subgraph induced by this vertex subset is connected. Our algorithm is composed of two phases: the first phase computes a dominating set, which has approximation ratio \(6 + \varepsilon\) (\(\varepsilon\) is an arbitrary positive number), while the second phase connects the dominating sets computed in the first phase, which has approximation ratio 4.