The planar k-means problem is NP-hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5431 LNCS, Issue , 2009, Pages 274-285

  Mahajan, Meena ^a   Nimbhorkar, Prajakta ^a   Varadarajan, Kasturi ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EUCLIDEAN DISTANCE; FINITE SET; K POINTS; K-MEANS; NP-HARD;

SET THEORY;

COMPUTATIONAL COMPLEXITY;

EID: 67650468452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00202-1_24     Document Type: Conference Paper

References (19)

1. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-Hardness of Euclidean Sumof- Squares Clustering. Technical Report G-2008-33, Les Cahiers du GERAD (to appear in Machine Learning) (April 2008)
2. Allender, E., Datta, S., Roy, S.: The directed planar reachability problem. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 238-249. Springer, Heidelberg (2005)
3. Arthur, D., Vassilvitskii, S.: Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method. In: Proc. IEEE Symp. Foundations of Computer Science (2006)
4. Arthur, D., Vassilvitskii, S.: How slow is the k-means method? In: Proc. Symp. on Comput. Geom. (2006)
5. Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: Proc. ACM-SIAM Symp. Discrete Algorithms (2007)
6. Dasgupta, S.: The hardness of k-means clustering. Technical Report CS2007-0890, University of California, San Diego (2007)
7. de la Vega, F., Karpinski, M., Kenyon, C.: Approximation schemes for clustering problems. In: Proc. ACM Symp. Theory of Computing, pp. 50-58 (2003)
8. Drineas, P., Friexe, A., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Machine Learning 56, 9-33 (2004)
9. Gibson, M., Kanade, G., Krohn, E., Pirwani, I., Varadarajan, K.: On clustering to minimize the sum of radii. In: Proc. ACM-SIAM Symp. Discrete Algorithms (2008)
10. Har-Peled, S., Sadri, B.: How fast is the k-means method? In: Proc. ACM-SIAM Symp. Discrete Algorithms, pp. 877-885 (2005)
11. Inaba, M., Katoh, N., Imai, H.: Applications of weighted Voronoi diagrams and randomization to variance-based clustering. In: Proc. Annual Symp. on Comput. Geom., pp. 332-339 (1994)
12. Kanungo, T., Mount, D., Netanyahu, N., Piatko, C., Silverman, R., Wu, A.: A local search approximation algorithm for k-means clustering. Comput. Geom. 28, 89-112 (2004)
13. Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time (1 + e) approximation algorithm for k-means clustering in any dimensions. In: Proc. IEEE Symp. Foundations of Computer Science, pp. 454-462 (2004)
14. Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proc. 21st Ann. IEEE Symp. Foundations of Computer Science, pp. 270-281 (1980)
15. Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11, 329-343 (1982)
16. Lloyd, S.: Least squares quantization in PCM. IEEE Transactions on Information Theory 28, 129-136 (1982)
17. Megiddo, N., Supowit, K.: On the complexity of some common geometric location problems. SIAM J. Comput. 13, 182-196 (1984)
18. Ostrovsky, R., Rabani, Y., Schulman, L., Swamy, C.: The effectiveness of Lloydtype methods for the k-means problem. In: Proc. IEEE Symp. Foundations of Computer Science (2006)
19. Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Transactions on Computers 30, 135-140 (1981)