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]

Authors

Marcel R. Ackermann

This author has not been identified. Look up 'Marcel R. Ackermann' in Google

Johannes Blömer

This author has not been identified. Look up 'Johannes Blömer' in Google

Christoph Scholz

This author has not been identified. Look up 'Christoph Scholz' in Google