NP-hard problems in hierarchical-tree clustering

Acta Informatica

Volumn 23, Issue 3, 1986, Pages 311-323

  Křivánek, Mirko ^a   Morávek, Jaroslav ^b  

^a Research Institute of Mathematical Machines ^*  (SCG)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - TREES;

COMPUTATIONAL COMPLEXITY; HIERARCHICAL-TREE CLUSTERING; NP-HARD PROBLEMS;

OPTIMIZATION;

EID: 0022735230     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/BF00289116     Document Type: Article

References (16)

1. On the Complexity of Clustering Problems
2. On the Computational Complexity of Clustering and Related Problems
3. Representation of Similarity Matrices by Trees
4. Hierarchical Clustering Schemes
5. Reducibility among Combinatorial Problems
6. On NP-Hardness in Hierarchical Clustering
7. Approximating Symmetric Relations by Equivalence Relations