1. Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Graphs. In: 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, pp. 3–14 (2006)
2. Basappa, M., Acharyya, R., Das, G.K.: Unit Disk Cover Problem in 2D. J. Discrete Algorithms 33, 193–201 (2015)
3. Călinescu, G., Măndoiu, I.I., Wan, P.J., Zelikovsky, A.Z.: Selecting forwarding neighbors in wireless ad hoc networks. Mobile Netw. Appl. 9(2), 101–111 (2004)
4. Carmi, P., Katz, M.J., Lev-Tov, N.: Covering Points by Unit Disks of Fixed Location, pp. 644–655. Springer, Berlin (2007)
5. Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the Red-blue Set Cover Problem. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’00, pp. 345–353. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)