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