Clustering to minimize the maximum intercluster distance
- 1 January 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 38, 293-306
- https://doi.org/10.1016/0304-3975(85)90224-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the computational complexity of clustering and related problemsPublished by Springer Nature ,2005
- On the Complexity of Clustering ProblemsPublished by Springer Nature ,1978
- Dynamic Information and Library Processing. Gerard SaltonThe Library Quarterly, 1977
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- The SMART retrieval system; experiments in automatic document processing: Edited by Gerard Salton, Prentice-Hall, Englewood Cliffs, New Jersey, 1971. 556 pagesInformation Storage and Retrieval, 1973
- 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