DMCA
Geometric Clusterings (1990)
Cached
Download Links
- [page.inf.fu-berlin.de]
- [page.inf.fu-berlin.de]
- [page.inf.fu-berlin.de]
- [www.inf.fu-berlin.de]
- [www.inf.fu-berlin.de]
- [page.mi.fu-berlin.de]
- DBLP
Other Repositories/Bibliography
by
Vasilis Capoyleas
,
Günter Rote
,
Gerhard Woeginger
| Citations: | 29 - 1 self |
BibTeX
@MISC{Capoyleas90geometricclusterings,
author = {Vasilis Capoyleas and Günter Rote and Gerhard Woeginger},
title = {Geometric Clusterings},
year = {1990}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("clusters"). For any fixed k, we can find a k-clustering which minimizes any monotone function of the diameters or the radii of the clusters in polynomial time. The algorithm is based on the fact that any two clusters in an optimal solution can be separated by a line.
