Faster Algorithms for the Constrained k-Means Problem

Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar 0001. Faster Algorithms for the Constrained k-Means Problem. In Nicolas Ollinger, Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. Volume 47 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

@inproceedings{BhattacharyaJ016,
  title = {Faster Algorithms for the Constrained k-Means Problem},
  author = {Anup Bhattacharya and Ragesh Jaiswal and Amit Kumar 0001},
  year = {2016},
  doi = {10.4230/LIPIcs.STACS.2016.16},
  url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2016.16},
  researchr = {https://researchr.org/publication/BhattacharyaJ016},
  cites = {0},
  citedby = {0},
  booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France},
  editor = {Nicolas Ollinger and Heribert Vollmer},
  volume = {47},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-001-9},
}