The planar k-means problem is NP-hard

被引：149
|
作者：
Mahajan, Meena [1 ]
Nimbhorkar, Prajakta [1 ]
Varadarajan, Kasturi [2 ]
机构：
[1] Inst Math Sci, Madras 600113, Tamil Nadu, India
[2] Univ Iowa, Iowa City, IA 52242 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2012年 / 442卷
关键词：
Clustering; k-means; Planar graphs; NP-hardness;
D O I：
10.1016/j.tcs.2010.05.034
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the k-means problem, we are given a finite set S of points in R-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 (2007) [7]. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：13 / 21
页数：9
相关论文
共 50 条
  • [41] A computationally faster randomized algorithm for NP-hard controller design problem
    Moses, M. Jerome
    Ramakalyan, Ayyagari
    1600, Springer Verlag (235): : 411 - 417
  • [42] What is the Right Context for an Engineering Problem: Finding Such a Context is NP-Hard
    Ceberio, Martine
    Kreinovich, Vladik
    Nguyen, Hung T.
    Sriboonchitta, Songsak
    Ouncharoen, Rujira
    2015 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2015, : 1621 - 1626
  • [43] An Improved Ants Colony Algorithm for NP-hard Problem of Travelling Salesman
    Luo Yabo
    Zhang, Shikun
    Feng, Zhang
    PERVASIVE COMPUTING AND THE NETWORKED WORLD, 2014, 8351 : 432 - 440
  • [44] SPACE-TIME ISOMORPHISM-PROBLEM IS INTRACTABLE (NP-HARD)
    KREINOVICH, V
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1991, 30 (09) : 1249 - 1257
  • [45] A Fast And Optimal Deterministic Algorithm For NP-Hard Antenna Selection Problem
    Iqbal, Naveed
    Schneider, Christian
    Thom, Reiner S.
    2015 IEEE 26TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2015, : 895 - 899
  • [46] On the Solution of the Steiner Tree NP-Hard Problem via Physarum BioNetwork
    Caleffi, Marcello
    Akyildiz, Ian F.
    Paura, Luigi
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (04) : 1092 - 1106
  • [47] Solution of the NP-hard total tardiness minimization problem in scheduling theory
    Lazarev A.A.
    Computational Mathematics and Mathematical Physics, 2007, 47 (6) : 1039 - 1049
  • [48] CONVEX APPROXIMATION OF THE NP-HARD SEARCH PROBLEM IN FEATURE SUBSET SELECTION
    Naghibi, Tofigh
    Hoffmann, Sarah
    Pfister, Beat
    2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 3273 - 3277
  • [49] What is the Right Context for an Engineering Problem: Finding Such a Context is NP-Hard
    Ceberio, Martine
    Kreinovich, Vladik
    Nguyen, Hung T.
    Sriboonchitta, Songsak
    Ouncharoen, Rujira
    2015 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2015, : 1615 - 1620
  • [50] PREDICTION-PROBLEM IN QUANTUM-MECHANICS IS INTRACTABLE (NP-HARD)
    KREINOVICH, V
    VAZQUEZ, A
    KOSHELEVA, O
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1991, 30 (02) : 113 - 122
12345