@kde-alumni

Hardness and Non-Approximability of Bregman Clustering Problems.

, , and . Electronic Colloquium on Computational Complexity (ECCC) (2011)

Links and resources

URL:
BibTeX key:
journals/eccc/TR11-015
search on:

Comments and Reviews  
(0)

There is no review or comment yet. You can write one!

Tags


Cite this publication