1. C. Ambühl, T. Erlebach, M. Mihalák, M. Nunkesser, Constant-Factor Approximation for Minimum-Weight (Connect) Dominating Sets in Unit Disk Graphs. Lecture Notes in Computer Science, vol. 4110 (2006), pp. 3–14
2. D. Dai, C. Yu, A (5 + ε)-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 410, 756–765 (2009)
3. L. Ding, W. Wu, J.K. Willson, L. Wu, Z. Lu, W. Lee, Constant-approximation for target coverage problem in wireless sensor networks, in Proceedings of the 31st Annual Joint Conference of IEEE Communication and Computer Society (INFOCOM) (2012)
4. D.-Z. Du, K.-I. Ko, X. Hu, Design and Analysis of Approximation Algorithms (Springer, Berlin, 2011)
5. T. Erlebach, M. Mihal, A (4 + 𝜖)-approximation for the minimum-weight dominating set problem in unit disk graphs, in WAOA (2009), pp. 135–146