Hardness and Non-Approximability of Bregman Clustering Problems

Marcel R. Ackermann, Johannes Blömer, Christoph Scholz. Hardness and Non-Approximability of Bregman Clustering Problems. Electronic Colloquium on Computational Complexity (ECCC), 18:15, 2011. [doi]

Abstract

Abstract is missing.