C. Baur and S. P. , Fekete: Approximation of geometric dispersion problems, Algorithmica, pp.30-451, 2001.

M. Benkert, J. Gudmundsson, C. Knauer, R. Van-oostrum, and A. Wolff, A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM, International Journal of Computational Geometry & Applications, vol.19, issue.03, pp.267-288, 2009.
DOI : 10.1142/S0218195909002952

S. Cabello, Approximation algorithms for spreading points, Journal of Algorithms, vol.62, issue.2, pp.49-73, 2007.
DOI : 10.1016/j.jalgor.2004.06.009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.1547

E. D. Demaine, M. Hajiaghayi, H. Mahini, A. S. Sayedi-roshkhar, S. Oveisgharan et al., Minimizing movement, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.258-267, 2007.
DOI : 10.1145/1541885.1541891

H. Edelsbrunner, Algorithms in Combinatorial Geometry, 1987.
DOI : 10.1007/978-3-642-61568-9

J. Fiala, J. Kratochvíl, and A. , Systems of distant representatives, Discrete Applied Mathematics, vol.145, issue.2, pp.306-316, 2005.
DOI : 10.1016/j.dam.2004.02.018

M. Formann and F. Wagner, A packing problem with applications to lettering of maps, Proceedings of the seventh annual symposium on Computational geometry , SCG '91, pp.281-288, 1991.
DOI : 10.1145/109648.109680

M. Jiang, S. Bereg, Z. Qin, and B. Zhu, New Bounds on Map Labeling with Circular Labels, Proceedings of the 15th Annual International Symposium on Algorithms and Computation, pp.606-617, 2004.
DOI : 10.1007/978-3-540-30551-4_53