1. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithm. 31(1), 228–248 (1999)
2. Cohen-Addad V., Gupta A., Kumar A., Lee E., Li J.: Tight FPT approximations for $$k$$-median and $$k$$-means. In: The Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, pp. 42 (2019)
3. Cohen-Addad V., Grandoni F., Lee E., Schwiegelshohn C.: Breaching the 2 LMP approximation barrier for facility location with applications to $$k$$-median. In: The Proceedings of the 34th ACM-SIAM Symposium on Discrete Algorithms, pp. 940–986 (2023)
4. Cohen-Addad V., Esfandiari H., Mirrokni V. S., Narayanan S.: Improved approximations for Euclidean $$k$$-means and $$k$$-median, via nested quasi-independent sets. In: The Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1621–1628 (2022)
5. Kumar A., Sabharwal Y.: The priority $$k$$-median problem. In: The Proceedings of the 27th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 71–83 (2007)