1. K. M. Alzoubi, P.-J. Wan, and O. Frieder. Distributed heuristics for connected dominating set in wireless ad hoc networks. IEEE ComSoc/KICS Journal on Communication Networks, 4 (1): 22–29, 2002.
2. B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. 31st Symp. Found. Computer Science, pages 514–522, 1990.
3. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM (JACM), 41 (1): 153–180, 1994.
4. S. Butenko, X. Cheng, D.-Z. Du, and P. M. Pardalos. On the construction of virtual backbone for ad hoc wireless network. In S. Butenko, R. Murphey, and P. M. Pardalos, editors, Cooperative Control: Models, Applications and Algorithms, pages 43–54. Kluwer Academic Publishers, 2002.
5. X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du. Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. To appear in Networks, 2003.