Ahmadian, S., Norouzi-Fard, A., Svensson, O., and Ward, J. Better guarantees for k-means and euclidean k-median by primal-dual algorithms. SIAM J. Comput., 49(4), 2020. doi: 10.1137/18M1171321. URL https://doi.org/10.1137/18M1171321.
Arthur, D. and Vassilitskii, S. K-means++: The advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '07, pp. 1027-1035, USA, 2007. Society for Industrial and Applied Mathematics. ISBN 9780898716245. URL https://dl.acm.org/doi/10.5555/1283383.1283494.
Carlsson, G. E. and Mémoli, F. Characterization, stability and convergence of hierarchical clustering methods. J. Mach. Learn. Res., 11:1425-1470, 2010.
Charikar, M. and Chatziafratis, V. Approximate hierarchical clustering via sparsest cut and spreading metrics. In Klein, P. N. (ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 841-854. SIAM, 2017. doi: 10.1137/1.9781611974782.53. URL https://doi.org/10.1137/1.9781611974782.53.
Charikar, M., Guha, S., Tardos, É., and Shmoys, D. B. A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci., 65(1):129-149, 2002. doi: 10.1006/jcss.2002.1882. URL https://doi.org/10.1006/jcss.2002.1882.
Cohen-Addad, V., Kanade, V., Mallmann-Trenn, F., and Mathieu, C. Hierarchical clustering: Objective functions and algorithms. J. ACM, 66(4):26:1-26:42, 2019. doi: 10.1145/3321386. URL https://doi.org/10.1145/3321386.
Csrik, J., Kellerer, H., and Woeginger, G. J. The exact lpt-bound for maximizing the minimum completion time. Oper. Res. Lett., 11(5):281-287, 1992. doi: 10.1016/0167-6377(92)90004-M. URL https://doi.org/10.1016/0167-6377(92)90004-M.
Dasgupta, S. A cost function for similarity-based hierarchical clustering. In Wicha, D. and Mansour, Y. (eds.), Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pp. 118-127. ACM, 2016. doi: 10.1145/2897518.2897527. URL https://doi.org/10.1145/2897518.2897527.
Davies, D. L. and Bouldin, D. W. A Cluster Separation Measure. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-1(2):224-227, April 1979. ISSN 1939-3539. doi: 10.1109/TPAMI.1979.4766909. Conference Name: IEEE Transactions on Pattern Analysis and Machine Intelligence.
Frieze, A. M. and Jerrum, M. Improved approximation algorithms for MAX k-cut and MAX BISECTION. Algorithmica, 18(1):67-81, 1997. doi: 10.1007/BF02523688. URL https://doi.org/10.1007/BF02523688.
Garey, M. R. and Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). W. H. Freeman, first edition edition, 1979. ISBN 0716710455. URL http://www.amazon.com/Computers-Intractability-NP-Completeness-Mathematical-Sciences/dp/0716710455.
Gong, Z., Zhong, P., and Hu, W. Diversity in machine learning. *IEEE Access*, 7:64323-64350, 2019.
Gonzalez, T. F. Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci., 38:293-306, 1985. doi: 10.1016/0304-3975(85)90224-5. URL https://doi.org/10.1016/0304-3975(85)90224-5.
Gupta, D. and Ghafir, S. An overview of methods maintaining diversity in genetic algorithms. International journal of emerging technology and advanced engineering, 2(5):56-60, 2012.
Hennig, C., Meila, M., Murtagh, F., and Rocci, R. Handbook of Cluster Analysis. Chapman and Hall/CRC, 2015.
Hofmeyr, D. P. Connecting spectral clustering to maximum margins and level sets. The Journal of Machine Learning Research, 21(1):630-664, 2020.