Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi. K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front. In Hoai An Le Thi, Hoai Minh Le, Tao Pham Dinh, editors, Optimization of Complex Systems: Theory, Models, Algorithms and Applications, WCGO 2019, World Congress on Global Optimization, Metz, France, 8-10 July, 2019. Volume 991 of Advances in Intelligent Systems and Computing, pages 790-799, Springer, 2019. [doi]
Abstract is missing.