%0 Journal Article %1 journals/eccc/TR11-015 %A Ackermann, Marcel R. %A Blömer, Johannes %A Scholz, Christoph %D 2011 %J Electronic Colloquium on Computational Complexity (ECCC) %K %P 20 %T Hardness and Non-Approximability of Bregman Clustering Problems. %U http://eccc.hpi-web.de/report/2011/015/ %V 18

@article{journals/eccc/TR11-015, added-at = {2023-12-13T02:37:24.000+0100}, author = {Ackermann, Marcel R. and Blömer, Johannes and Scholz, Christoph}, biburl = {https://www.bibsonomy.org/bibtex/2762c0e94b3be12bff214b24ffeb2e38b/admin}, ee = {http://eccc.hpi-web.de/report/2011/015/}, interhash = {818d82d6a303bbc181fe18206fa83366}, intrahash = {762c0e94b3be12bff214b24ffeb2e38b}, journal = {Electronic Colloquium on Computational Complexity (ECCC)}, keywords = {}, pages = 20, timestamp = {2023-12-13T02:37:24.000+0100}, title = {Hardness and Non-Approximability of Bregman Clustering Problems.}, url = {http://eccc.hpi-web.de/report/2011/015/}, volume = 18, year = 2011 }