1. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Tatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, NewYork (1972)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability. A guide to the Theory of NP-completeness. Freeman, New York (1979)
3. Leiserson, C.E., Rivest, R.L., Cormen, T.H., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill Book Company (1976)
4. Rappaport, T.S.: Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs (1996)
5. Kim, B., Yang, J., Zhou, D., Sun, M.: Energy-Aware Connected Dominating Set Construction in Mobile Ad Hoc Networks. In: Proc. 14th International Conference on Computer Communications and Networks, pp. 229–234 (2005)