Approximation schemes for clustering problems
Let k be a fixed integer. We consider the problem of partitioning an input set of points endowed with a distance function into k clusters. We give polynomial time approximation ...
Publications
1 shownFrequent Co-Authors
Researcher Info
- h-index
- 1
- Publications
- 1
- Citations
- 158
- Institution
- University of Bonn
External Links
Impact Metrics
h-index
1
h-index: Number of publications with at least h citations each.