R. J. Fowler, M. S. Paterson, and S. L. , Tanimoto Optimal packing and covering in the plane are NP-complete Information Processing Letters, pp.133-137, 1981.

B. M. Chazelle and D. T. , ??ber ein Problem der Kreisscheibenplazierung, Computing, vol.7, issue.4, pp.1-16, 1986.
DOI : 10.1007/BF02238188

A. Gajentaan and M. H. , On a class of O(n2) problems in computational geometry, Computational Geometry, vol.5, issue.3, pp.165-185, 1995.
DOI : 10.1016/0925-7721(95)00022-2

B. Aronov and S. , Har-Peled On approximating the depth and related problems, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.886-894, 2005.

C. M. De-figueiredo and G. D. Da-fonseca, Enclosing weighted points with an almost-unit ball, Information Processing Letters, vol.109, issue.21-22, pp.21-221216, 2009.
DOI : 10.1016/j.ipl.2009.09.001

M. De-berg, S. Cabello, and S. , Har-Peled Covering many or few points with unit disks, Theory of Computing Systems, pp.446-469, 2009.

H. Ghasemalizadeh and M. , An Improved Approximation Algorithm for the Most Points Covering Problem, Theory of Computing Systems, vol.33, issue.3, pp.545-558, 2012.
DOI : 10.1007/s00224-011-9353-4