{"date_updated":"2022-01-06T06:58:50Z","citation":{"mla":"Ackermann, Marcel R., et al. <i>Hardness and Non-Approximability of Bregman Clustering Problems.</i> 2011.","apa":"Ackermann, M. R., Blömer, J., &#38; Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.","bibtex":"@article{Ackermann_Blömer_Scholz_2011, series={Electronic Colloquium on Computational Complexity (ECCC)}, title={Hardness and Non-Approximability of Bregman Clustering Problems.}, author={Ackermann, Marcel R and Blömer, Johannes and Scholz, Christoph}, year={2011}, collection={Electronic Colloquium on Computational Complexity (ECCC)} }","ieee":"M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.","ama":"Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.","short":"M.R. Ackermann, J. Blömer, C. Scholz, (2011).","chicago":"Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011."},"user_id":"25078","series_title":"Electronic Colloquium on Computational Complexity (ECCC)","department":[{"_id":"64"}],"author":[{"full_name":"Ackermann, Marcel R","last_name":"Ackermann","first_name":"Marcel R"},{"full_name":"Blömer, Johannes","last_name":"Blömer","id":"23","first_name":"Johannes"},{"first_name":"Christoph","last_name":"Scholz","full_name":"Scholz, Christoph"}],"year":"2011","type":"conference","status":"public","title":"Hardness and Non-Approximability of Bregman Clustering Problems.","date_created":"2018-06-05T07:47:21Z","publication_status":"published","_id":"2985"}