1. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks;Chen,2002
2. Clustering wireless ad hoc networks with weakly connected dominating set;Han;J. Parall. Distrib. Comput.,2007
3. Unit disk graphs;Clark;Discr. Math.,1990
4. V. Kann, On the Approximability of NP-Complete Optimization Problems, Ph.D. Thesis, Royal Institute of Technology, Stockholm, 1992.
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979