V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala et al., Local Search Heuristics for k-Median and Facility Location Problems, SIAM J. Comput, vol.33, issue.3, pp.544-562, 2004.

V. Braverman, D. Feldman, and H. Lang, New Frameworks for Offline and Streaming Coreset Constructions. CoRR, 2016.

J. Byrka, T. Pensyl, B. Rybicki, A. Srinivasan, and K. Trinh, An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization, ACM Trans. Algorithms, vol.13, issue.2, p.31, 2017.

K. Chen, On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications, SIAM J. Comput, vol.39, issue.3, pp.923-947, 2009.

V. Cohen-addad, A Fast Approximation Scheme for Low-dimensional k-means, SODA 2018, pp.430-440, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02169544

V. Cohen-addad, A. E. Feldmann, and D. Saulpic, Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics, 2018.

V. Cohen-addad, A. Gupta, A. Kumar, E. Lee, and J. Li, Tight FPT Approximations for k-Median and k-Means. ICALP'19, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02360773

V. Cohen-addad, P. N. Klein, and C. Mathieu, Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics, FOCS 2016, pp.353-364, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02169522

V. Cohen-addad, M. Pilipczuk, and M. Pilipczuk, A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs, FOCS 2019, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02360765

V. Cohen-addad, M. Pilipczuk, and M. Pilipczuk, Efficient approximation schemes for uniform-cost clustering problems in planar graphs, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02371844

D. Feldman and M. Langberg, A Unified Framework for Approximating and Clustering Data. CoRR, abs/1106.1379, Conference version presented at STOC 2011, 2011.

W. Fernandez-de-la, M. Vega, C. Karpinski, Y. Kenyon, and . Rabani, Approximation schemes for clustering problems, STOC 2003, pp.50-58, 2003.

S. Guha and S. Khuller, Greedy Strikes Back: Improved Facility Location Algorithms, J. Algorithms, vol.31, issue.1, pp.228-248, 1999.

S. Har-peled, Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons, 2014.

D. S. Hochbaum, Heuristics for the fixed cost median problem, Math. Program, vol.22, issue.1, pp.148-162, 1982.

K. Jain and V. Vazirani, Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation, J. ACM, vol.48, issue.2, pp.274-296, 2001.

A. Kumar, Y. Sabharwal, and S. Sen, Linear-time approximation schemes for clustering problems in any dimensions, J. ACM, vol.57, issue.2, 2010.

S. Li, A 1.488 approximation algorithm for the uncapacitated facility location problem, Inf. Comput, vol.222, pp.45-58, 2013.
URL : https://hal.archives-ouvertes.fr/in2p3-00420482

D. Marx and M. Pilipczuk, Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, ESA 2015, vol.9294, pp.865-877, 2015.

J. Matou?ek, Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs, Erik Jan van Leeuwen, and Andreas Wiese, vol.24, pp.1-65, 2000.

B. David, É. Shmoys, K. Tardos, and . Aardal, Approximation algorithms for facility location problems, STOC 1997, pp.265-274, 1997.