Minimum sum of diameters clustering
- Cite this article as:
- Hansen, P. & Jaumard, B. Journal of Classification (1987) 4: 215. doi:10.1007/BF01896987
- 246 Downloads
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(N3 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(N5) time.