Abstract
The problem of determining a partition of a given set ofN entities intoM clusters such that the sum of the diameters of these clusters is minimum has been studied by Brucker (1978). He proved that it is NP-complete forM≥3 and mentioned that its complexity was unknown forM=2. We provide anO(N 3 logN) algorithm for this latter case. Moreover, we show that determining a partition into two clusters which minimizes any given function of the diameters can be done inO(N 5) time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
ASPVALL, B., PLASS, M. F., and TARJAN, R. E. (1979), “A Linear-time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas,”Information Processing Letters, 8, 121–123.
BRUCKER, P. (1978), “On the Complexity of Clustering Problems,” inOptimization and Operations Research, Lecture Notes in Economics and Mathematical Systems, 157, eds. M. Beckmann and H. P. Kunzi, Heidelberg: Springer-Verlag, 45–54.
CORMACK, R. M. (1971), “A Review of Classification,”Journal of the Royal Statistical Society, A(134), 321–367.
DELATTRE, M., and HANSEN, P. (1980), “Bicriterion Cluster Analysis,”IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-2(4, 277–291.
GORDON, A. D. (1981),Classification: Methods for the Exploratory Analysis of Multivariate Data, New York: Chapman and Hall.
HANSEN, P., and DELATTRE, M. (1978), “Complete-link Cluster Analysis by Graph Coloring,”Journal of the American Statistical Association, 73, 397–403.
HANSEN, P., JAUMARD, B., and MINOUX, M. (1986), “A Linear Expected-time Algorithm for Deriving All Logical Conclusions Implied by a Set of Boolean Inequalities,”Mathematical Programming, 34, 223–231.
HARTIGAN, J. A. (1975),Clustering Algorithms, New York: John Wiley & Sons.
JOHNSON, S.C. (1967), “Hierarchical Clustering Schemes,”Psychometrika, 32, 241–254.
KRUSKAL, J. B. (1956), “On the Shortest Subtree of a Graph and the Travelling Salesman Problem,”Proceedings of the American Mathematical Society, 71, 48–50.
RAO, M. R. (1971), “Cluster Analysis and Mathematical Programming,“Journal of the American Statistical Association, 66, 622–626.
WELCH, J.W. (1983), “Algorithmic Complexity: Three NP-hard Problems in Computational Statistics,”Journal of Statistical Computation and Simulation, 15, 17–25.
Author information
Authors and Affiliations
Additional information
Acknowledgments: This research was supported by the Air Force Office of Scientific Research Grant AFOSR 0271 to Rutgers University. We are grateful to Yves Crama for several insightful remarks and to an anonymous referee for detailed comments.
Rights and permissions
About this article
Cite this article
Hansen, P., Jaumard, B. Minimum sum of diameters clustering. Journal of Classification 4, 215–226 (1987). https://doi.org/10.1007/BF01896987
Issue Date:
DOI: https://doi.org/10.1007/BF01896987