1. Adamczyk, M., Byrka, J., Marcinkowski, J., Meesum, S.M., Wlodarczyk, M.: Constant-factor FPT approximation for capacitated k-median. In: 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)
2. Agrawal, A., Inamdar, T., Saurabh, S., Xue, J.: Clustering what matters: optimal approximation for clustering with outliers. J. Artif. Intell. Res. 78, 143–166 (2023)
3. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 21–29 (2001)
4. Badanidiyuru, A., Kleinberg, R., Lee, H.: Approximating low-dimensional coverage problems. In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry, pp. 161–170 (2012)
5. Bandyapadhyay, S., Fomin, F.V., Golovach, P.A., Purohit, N., Simonov, K.: FPT approximation for fair minimum-load clustering. In: 17th International Symposium on Parameterized and Exact Computation (2022)