1. Aggarwal, G., et al.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 49:1–49:19 (2010)
2. Aghamolaei, S., Ghodsi, M., Miri, S.: A mapreduce algorithm for metric anonymity problems. In: Proceedings of the 31st Canadian Conference on Computational Geometry, pp. 117–123 (2019)
3. Ahmadian, S., Swamy, C.: Approximation algorithms for clustering problems with lower bounds and outliers. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, pp. 69:1–69:15 (2016)
4. An, H., Bhaskara, A., Chekuri, C., Gupta, S., Madan, V., Svensson, O.: Centrality of trees for capacitated $$k$$-center. Math. Program. 154(1–2), 29–53 (2015)
5. Angelidakis, H., Kurpisz, A., Sering, L., Zenklusen, R.: Fair and fast $$k$$-center clustering for data summarization. In: Proceedings of the 39th International Conference on Machine Learning, pp. 669–702 (2022)