N. Alon, D. Moshkovitz, and S. Safra. Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms, 2(2):153-177, Apr. 2006.
 K. M. Alzoubi, P.-J. Wan, and O. Frieder. Message-optimal connected dominating sets in mobile ad hoc networks. In the Proceedings of the Int'l Symp. on Mobile Ad Hoc Net. and Comput., pages 157-164, 2002. [OpenAIRE]
 K. M. Alzoubi, P.-J. Wan, and O. Frieder. New distributed algorithm for connected dominating set in wireless ad hoc networks. In Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS), pages 3849-3855. IEEE, 2002. [OpenAIRE]
 B. Berger, J. Rompel, and P. W. Shor. Efficient NC algorithms for set cover with applications to learning and geometry. In Proc. of the Symp. on Found. of Comp. Sci. (FOCS), pages 454-477, 1994. [OpenAIRE]
 J. Blum, M. Ding, A. Thaeler, and X. Cheng. Connected dominating set in sensor networks and manets. In Handbook of Combinatorial Optimization, pages 329-369. Springer, 2005.
 X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks, 42(4):202- 208, 2003.
 X. Cheng, F. Wang, and D.-Z. Du. Connected dominating set. In Encyclopedia of Algorithms, pages 1-99. Springer, 2008.
 F. Dai and J. Wu. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 15(10):908- 920, 2004.
 B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In Proc. of the IEEE Int'l Conf. on Communications (ICC), volume 1, pages 376-380. IEEE, 1997.
 A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. In Proc. of the Symp. on Theory of Comp. (STOC), pages 363-372, 2011.
 A. Das Sarma, D. Nanongkai, and G. Pandurangan. Fast distributed random walks. In the Proc. of the Int'l Symp. on Princ. of Dist. Comp. (PODC), pages 161-170, 2009. [OpenAIRE]
 A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Efficient distributed random walks with applications. In the Proc. of the Int'l Symp. on Princ. of Dist. Comp. (PODC), pages 201-210, 2010.
 D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In Pro. of ACMSIAM Symp. on Disc. Alg. (SODA), pages 717-724, 2003. [OpenAIRE]
 M. Elkin. Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In Proc. of the Symp. on Theory of Comp. (STOC), pages 331-340, 2004.
 U. Feige. A threshold of ln n for approximating set cover (preliminary version). In Proc. of the Symp. on Theory of Comp. (STOC), pages 314-318, 1996.