Geometric Piercing Set Problem in Wireless Sensor Networks
Publisher
Springer Singapore
Reference20 articles.
1. Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of APPROX 2006 and RANDOM 2006, vol. 4110, pp. 3–14 (2006) 2. Bondy, A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer (2008) 3. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1–3), 165–177 (1990) 4. Claude, F., et al.: An improved line-separable algorithm for discrete unit disk cover. Discret. Math. Algorithms Appl. 2(1), 77–88 (2010) 5. Carmi, P., Das, G.K., Jallu, R.K., Nandy, S.C., Prasad, P.R., Stein, Y.: Minimum dominating set problem for unit disks revisited. Int. J. Comput. Geom. Appl. 25(3), 227 (2015)
|
|