scientific article; zbMATH DE number 3923897

MaRDI QIDQ3698098zbMATH OpenFDO

Authors Jaroslav Morávek, Mirko Křivánek

Publication date 1984

zbMATH Keywords

hierarchical-tree clusteringNP-hardness

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic methods, stochastic differential equations (65C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• NP-hard problems in hierarchical-tree clustering
• NP-hard approximation problems in overlapping clustering.
• NP-hardness of some max-min clustering problems
• scientific article; zbMATH DE number 2081029
• scientific article; zbMATH DE number 3930160

Cited in

(9)

• NP-hardness of Euclidean sum-of-squares clustering
• NP-hard problems in hierarchical-tree clustering
• A family of NP-complete data aggregation problems
• NP-hard approximation problems in overlapping clustering.
• Combinatorial optimization and hierarchical classifications
• Combinatorial optimisation and hierarchical classifications
• scientific article; zbMATH DE number 3930160 (Why is no real title available?)
• scientific article; zbMATH DE number 4034897 (Why is no real title available?)
• Computational complexity of two problems of cognitive data analysis

This page was built for publication:

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