The following publications are possibly variants of this publication:
- PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor NetworksHongwei Du, Qiang Ye, Jioafei Zhong, Yuexuan Wang, Wonjun Lee, Haesun Park. cocoa 2010: 252-259 [doi]
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networksXiuzhen Cheng, Xiao Huang, Deying Li, Weili Wu, Ding-Zhu Du. networks, 42(4):202-208, 2003. [doi]
- A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networksZhao Zhang, Xiaofeng Gao, Weili Wu, Ding-Zhu Du. jgo, 45(3):451-458, 2009. [doi]
- Construction algorithms for k-connected m-dominating sets in wireless sensor networksYiwei Wu, Yingshu Li. mobihoc 2008: 83-90 [doi]
- On calculating connected dominating set for efficient routing in ad hoc wireless networksJie Wu, Hailan Li. dialm 1999: 7-14 [doi]