On the complexity of some quadratic Euclidean partition problems into balanced clusters

DOI10.1007/978-3-030-38603-0_10zbMath1477.90085OpenAlexW2999397289MaRDI QIDQ1982892

Artem V. Pyatkin, Vladimir Khandeev, Alexander Kel'Manov

Publication date: 14 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_10

zbMATH Keywords

Euclidean spaceNP-completenessbalanced partitionquadratic variancenormalized by cluster sizesized-weighted

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Constant-factor approximation algorithms for some maximin multi-clustering problems