Hardness and Non-Approximability of Bregman Clustering Problems

Research Area: Practical theory for clustering algorithms Year: 2011
Type of Publication: Article
Authors: Marcel R. Ackermann; Johannes Blömer; Christoph Scholz
Journal: Electronic Colloquium on Computational Complexity, ECCC Volume: 18
Number: 15 Pages: 1-20
BibTex:
Note:
Report no. TR11-015.
[Bibtex]
[ Back ]