1. Adamczyk, M., Byrka, J., Marcinkowski, J., Meesum, S.M., Wlodarczyk, M.: Constant-factor FPT approximation for capacitated $$k$$-median. In: Proceedings of 27th Annual European Symposium on Algorithms, p. 1 (2019)
2. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean $$k$$-medians and related problems. In: Proceedings of 30th Annual ACM Symposium on Theory of Computing, pp. 106–113 (1998)
3. Bartal, Y., Gottlieb, L.A.: A linear time approximation scheme for Euclidean TSP. In: Proceedings of 54th Annual Symposium on Foundations of Computer Science, pp. 698–706 (2013)
4. Behsaz, B., Friggstad, Z., Salavatipour, M.R., Sivakumar, R.: Approximation algorithms for min-sum $$k$$-clustering and balanced $$k$$-median. Algorithmica 81(3), 1006–1030 (2019)
5. Bera, S., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. In: Proceedings of 33rd Advances in Neural Information Processing Systems, pp. 4954–4965 (2019)