The Planar k-Means Problem is NP-Hard

  • Meena Mahajan
  • Prajakta Nimbhorkar
  • Kasturi Varadarajan
Conference paper

DOI: 10.1007/978-3-642-00202-1_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5431)
Cite this paper as:
Mahajan M., Nimbhorkar P., Varadarajan K. (2009) The Planar k-Means Problem is NP-Hard. In: Das S., Uehara R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg

Abstract

In the k-means problem, we are given a finite set S of points in \(\Re^m\), and integer k ≥ 1, and we want to find k points (centers) so as to minimize the sum of the square of the Euclidean distance of each point in S to its nearest center. We show that this well-known problem is NP-hard even for instances in the plane, answering an open question posed by Dasgupta [6].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Meena Mahajan
    • 1
  • Prajakta Nimbhorkar
    • 1
  • Kasturi Varadarajan
    • 2
  1. 1.The Institute of Mathematical SciencesChennaiIndia
  2. 2.The University of IowaIowa CityUSA

Personalised recommendations