All reports by Author Marcel R. Ackermann:

__
TR11-015
| 8th December 2010
__

Marcel R. Ackermann, Johannes BlĂ¶mer, Christoph Scholz#### Hardness and Non-Approximability of Bregman Clustering Problems

Marcel R. Ackermann, Johannes BlĂ¶mer, Christoph Scholz

We prove the computational hardness of three k-clustering problems using an (almost) arbitrary Bregman divergence as dissimilarity measure: (a) The Bregman k-center problem, where the objective is to find a set of centers that minimizes the maximum dissimilarity of any input point towards its closest center, and (b) the Bregman ... more >>>