On the complexity of the problem of choice of large clusters

DOI10.33048/DAIO.2024.31.787MaRDI QIDQ6648360zbMATH OpenFDO

Authors Artem Pyatkin

Publication date 4 December 2024

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/DAIO.2024.31.787

zbMATH Keywords

centroidclusterNP-hardnessscatter

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• Constant-factor approximation algorithms for some maximin multi-clustering problems
• Grouping Multidimensional Data
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• NP-hardness of Euclidean sum-of-squares clustering
• On Grouping for Maximum Homogeneity
• Size constrained distance clustering: separation properties and some complexity results
• Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete

This page was built for publication: On the complexity of the problem of choice of large clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648360)