1. Aghamolaei, S., Farhadi, M., Zarrabi-Zadeh, H.: Diversity maximization via composable coresets. In: Proceedings of 27th Canadian Conference on Computational Geometry, p. 43 (2015)
2. An, H.-C., Bhaskara, A., Chekuri, C., Gupta, S., Madan, V., Svensson, O.: Centrality of trees for capacitated $$k$$-center. Math. Program. 154(1), 29–53 (2015). https://doi.org/10.1007/s10107-014-0857-y
3. Barilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms 15(3), 385–415 (1993)
4. Bateni, M., Bhaskara, A., Lattanzi, S., Mirrokni, V.: Distributed balanced clustering via mapping coresets. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems, pp. 2591–2599 (2014)
5. Ceccarello, M., Pietracaprina, A., Pucci, G.: Solving $$k$$-center clustering (with outliers) in mapreduce and streaming, almost as accurately as sequentially. In: Proceedings of the 45th International Conference on Very Large Data Bases, vol. 12, pp. 766–778 (2019)