Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2010, Volume 17, Issue 5, Pages 37–45 (Mi da623)  
This article is cited in 40 scientific papers (total in 40 papers)

NP-completeness of some problems of a vectors subset choice

A. V. Kel'manovab, A. V. Pyatkinab

a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (238 kB) Citations (40)
References:
PDF
HTML
Abstract: One of the problem in data analysis reduces to problems of a vectors subset selection. The NP-completeness of these problems is proved. These problems are connected with searching a vector subset in a given set in Euclidian space under following conditions. The first condition is that the required subset has a given cardinality, and the second one is that this subset includes vectors which are close to each other under the criterion of minimum sum of squared distances. Bibliogr. 13.
Keywords: choice of a vector subset, clustering, algorithmic complexity, NP-completeness.
Received: 12.04.2010
Revised: 06.07.2010
English version:
Journal of Applied and Industrial Mathematics, 2011, Volume 5, Issue 3, Pages 352–357
DOI: https://doi.org/10.1134/S1990478911030069
Bibliographic databases:
Document Type: Article
UDC: 519.2+621.391
Language: Russian
Citation: A. V. Kel'manov, A. V. Pyatkin, “NP-completeness of some problems of a vectors subset choice”, Diskretn. Anal. Issled. Oper., 17:5 (2010), 37–45; J. Appl. Industr. Math., 5:3 (2011), 352–357
Citation in format AMSBIB
\Bibitem{KelPya10}
\by A.~V.~Kel'manov, A.~V.~Pyatkin
\paper NP-completeness of~some problems of a~vectors subset choice
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 5
\pages 37--45
\mathnet{http://mi.mathnet.ru/da623}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2779350}
\zmath{https://zbmath.org/?q=an:1249.68080}
\transl
\jour J. Appl. Industr. Math.
\yr 2011
\vol 5
\issue 3
\pages 352--357
\crossref{https://doi.org/10.1134/S1990478911030069}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80052019433}
Linking options:
  • https://www.mathnet.ru/eng/da623
  • https://www.mathnet.ru/eng/da/v17/i5/p37
    • This publication is cited in the following 40 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:664
    Full-text PDF :247
    References:66
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024