V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala et al., -Median and Facility Location Problems, SIAM Journal on Computing, vol.33, issue.3, pp.544-562, 2004.
DOI : 10.1137/S0097539702416402
URL : https://hal.archives-ouvertes.fr/hal-00857508

M. Badoiu and K. L. Clarkson, Smaller core-sets for balls, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp.801-802, 2003.

M. B¯-adoiu, S. Har-peled, and P. Indyk, Approximate clustering via core-sets, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp.250-257, 2002.

Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, Proceedings of 37th Conference on Foundations of Computer Science, pp.184-193, 1996.
DOI : 10.1109/SFCS.1996.548477

M. Charikar, S. Guha, ´. E. Tardos, and D. B. Shmoys, A Constant-Factor Approximation Algorithm for the k-Median Problem, Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp.1-10, 1999.
DOI : 10.1006/jcss.2002.1882

B. Chazelle and J. Matou?ek, On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension, Journal of Algorithms, vol.21, issue.3, pp.579-597, 1996.
DOI : 10.1006/jagm.1996.0060

C. A. Coello, D. A. Van-veldhuizen, and G. B. Lamont, Evolutionary algorithms for solving multi-objective problems, 2002.
DOI : 10.1007/978-1-4757-5184-0

K. Deb, Multi-objective optimization using evolutionary algorithms, 2001.

S. Har-peled and A. Kushal, Smaller coresets for k-median and k-means clustering, Proceedings of the twenty-first annual symposium on Computational geometry, pp.126-134, 2005.
DOI : 10.1145/1064092.1064114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.4073

S. Har-peled and S. Mazumdar, Coresets for k-means and k-median clustering and their applications, pp.291-300, 2004.
DOI : 10.1145/1007352.1007400

D. Hochbaum and D. Shmoys, -Center Problem, Mathematics of Operations Research, vol.10, issue.2, pp.180-198, 1985.
DOI : 10.1287/moor.10.2.180
URL : https://hal.archives-ouvertes.fr/hal-00897097

K. Jain, M. Mahdian, and A. Saberi, A new greedy approach for facility location problems, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.731-740, 2002.
DOI : 10.1145/509907.510012
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.4544

N. Megiddo and K. J. Supowit, On the Complexity of Some Common Geometric Location Problems, SIAM Journal on Computing, vol.13, issue.1, pp.182-196, 1984.
DOI : 10.1137/0213014

A. Meyerson, L. O. Callaghan, and S. Plotkin, A k-Median Algorithm with Running Time Independent of Data Size, Machine Learning, pp.61-87, 2004.
DOI : 10.1023/B:MACH.0000033115.78247.f0

C. H. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access of Web sources, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.86-92, 2000.
DOI : 10.1109/SFCS.2000.892068

D. B. Shmoys, Approximation Algorithms for Facility Location Problems, Approximation Algorithms for Combinatorial Optimization, pp.27-32, 2000.
DOI : 10.1007/3-540-44436-X_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9226

B. C. Tansel, R. L. Francis, and T. J. Lowe, -Median Problems, Management Science, vol.29, issue.4, pp.482-497, 1983.
DOI : 10.1287/mnsc.29.4.482

H. Zarrabi-zadeh and T. M. Chan, A simple streaming algorithm for minimum enclosing balls, CCCG. Citeseer, 2006.

H. Zarrabi-zadeh and A. Mukhopadhyay, Streaming 1-center with outliers in high dimensions, CCCG, pp.83-86, 2009.