1. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979)
2. R. Bar-Yehuda, S. Moran, On approximation problems related to the independent set and vertex cover problem. Discrete Appl. Math. 9, 1–10 (1984)
3. R. Jovanovic, M. Tuba, D. Simian, Ant colony optimization applied to minimum weight dominating set problem, in Proceedings of the 12th WSEAS International Conference on Automatic Control, Modeling and Simulation (World Scientific and Engineering Academy and Society (WSEAS), 2010), pp. 322–326
4. A. Potluri, A. Singh, Hybrid Metaheuristic algorithms for minimum weight dominating set. Appl. Soft Comput. 13(1), 76–88 (2013)
5. D. Dai, C. Yu, 5+∈-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 410, 756–765 (2009)