A Distributed Algorithm to Approximate Node-Weighted Minimum alpha-Connected (Theta, k)-Coverage in Dense Sensor Networks

Yongan Wu, Min Li, Zhiping Cai, En Zhu. A Distributed Algorithm to Approximate Node-Weighted Minimum alpha-Connected (Theta, k)-Coverage in Dense Sensor Networks. In Franco P. Preparata, Xiaodong Wu, Jianping Yin, editors, Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings. Volume 5059 of Lecture Notes in Computer Science, pages 221-232, Springer, 2008. [doi]

@inproceedings{WuLCZ08,
  title = {A Distributed Algorithm to Approximate Node-Weighted Minimum alpha-Connected (Theta, k)-Coverage in Dense Sensor Networks},
  author = {Yongan Wu and Min Li and Zhiping Cai and En Zhu},
  year = {2008},
  doi = {10.1007/978-3-540-69311-6_24},
  url = {http://dx.doi.org/10.1007/978-3-540-69311-6_24},
  tags = {coverage},
  researchr = {https://researchr.org/publication/WuLCZ08},
  cites = {0},
  citedby = {0},
  pages = {221-232},
  booktitle = {Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings},
  editor = {Franco P. Preparata and Xiaodong Wu and Jianping Yin},
  volume = {5059},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-69310-9},
}