The planar k-means problem is NP-hard

@article{Mahajan2012ThePK,
  title={The planar k-means problem is NP-hard},
  author={Meena Mahajan and Prajakta Nimbhorkar and Kasturi R. Varadarajan},
  journal={Theor. Comput. Sci.},
  year={2012},
  volume={442},
  pages={13-21}
}

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…