The following publications are possibly variants of this publication:
- On constructing k-connected k-dominating set in wireless ad hoc and sensor networksFei Dai, Jie Wu. jpdc, 66(7):947-958, 2006. [doi]
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networksHongwei Du, Qiang Ye, Jiaofei Zhong, Yuexuan Wang, Wonjun Lee, Haesun Park. TCS, 447:38-43, 2012. [doi]
- Minimum connected dominating sets in heterogeneous 3D wireless ad hoc networksXin Bai 0004, Danning Zhao, Sen Bai, Qiang Wang, Weilue Li, Dongmei Mu. adhoc, 97, 2020. [doi]