On the computational complexity of clustering and related problems
- 29 September 2005
- book chapter
- Published by Springer Nature
- p. 174-182
- https://doi.org/10.1007/bfb0006133
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- A graph theoretic approach to the grouping of ordering dataNetworks, 1972
- Admissible clustering proceduresBiometrika, 1971
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- On Grouping for Maximum HomogeneityJournal of the American Statistical Association, 1958