Highly Influenced

# Approximation Algorithm for Minimum Weight (k, m)-CDS Problem in Unit Disk Graph

@article{Shi2015ApproximationAF, title={Approximation Algorithm for Minimum Weight (k, m)-CDS Problem in Unit Disk Graph}, author={Yishuo Shi and Zhao Zhang and Dingzhu Du}, journal={CoRR}, year={2015}, volume={abs/1508.05515} }

- Published 2015 in ArXiv

In a wireless sensor network, the virtual backbone plays an important role. Due to accidental damage or energy depletion, it is desirable that the virtual backbone is fault-tolerant. A fault-tolerant virtual backbone can be modeled as a k-connected m-fold dominating set ((k,m)-CDS for short). In this paper, we present a constant approximation algorithm for the minimum weight (k,m)-CDS problem in unit disk graph under the assumption thatm ≥ k. Prior to this work, constant approximation… CONTINUE READING