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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Yongan Wu' in GoogleThis author has not been identified. Look up 'Min Li' in GoogleThis author has not been identified. Look up 'Zhiping Cai' in GoogleThis author has not been identified. Look up 'En Zhu' in Google

runs on WebDSL