Advertisement

NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points

  • A. V. Kel’manov
  • A. V. Pyatkin
Article

Abstract

Problems of partitioning a finite set of Euclidean points (vectors) into clusters are considered. The criterion is to minimize the sum, over all clusters, of (1) squared norms of the sums of cluster elements normalized by the cardinality, (2) squared norms of the sums of cluster elements, and (3) norms of the sum of cluster elements. It is proved that all these problems are strongly NP-hard if the number of clusters is a part of the input and are NP-hard in the ordinary sense if the number of clusters is not a part of the input (is fixed). Moreover, the problems are NP-hard even in the case of dimension 1 (on a line).

Keywords

partitioning Euclidean space norm of sum NP-hardness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V. Eremeev, A. V. Kel’manov, and A. V. Pyatkin, “On the complexity of some Euclidean optimal summing problems,” Dokl. Math. 93 (3), 286–288 (2016).MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    A. V. Kel’manov and A. V. Pyatkin, “Complexity of certain problems of searching for subsets of vectors and cluster analysis,” Comput. Math. Math. Phys. 49 (11), 1966–1971 (2009).MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    C. C. Aggarwal, Data Mining (Springer International, Berlin, 2015).CrossRefzbMATHGoogle Scholar
  4. 4.
    M. C. Bishop, Pattern Recognition and Machine Learning (Springer Science + Business Media, New York, 2006).zbMATHGoogle Scholar
  5. 5.
    T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction (Springer-Verlag, New York, 2001).CrossRefzbMATHGoogle Scholar
  6. 6.
    M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).zbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.Sobolev Institute of Mathematics, Siberian BranchRussian Academy of SciencesNovosibirskRussia
  2. 2.Novosibirsk State UniversityNovosibirskRussia

Personalised recommendations