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, 2011, Volume 18, Issue 1, Pages 61–69 (Mi da638)  
This article is cited in 32 scientific papers (total in 32 papers)

The approximation algorithm for one problem of searching for subset of vectors

A. V. Kel'manovab, S. M. Romanchenkob

a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (245 kB) Citations (32)
References:
PDF
HTML
Abstract: One problem in data analysis was earlier reduced to the specific NP-hard optimization problem. In this problem one needs to find a subset of given set of Euclidean vectors satisfying the following conditions. Firstly the required subset must have the given cardinality and secondly it should include vectors which are mutually close under the criterion of minimum sum of squared distances. In the paper, an effective 2-approximation algorithm for this problem is proved. Bibliogr. 3.
Keywords: searching for subset of vectors, NP-hardness, effective approximation algorithm.
Received: 26.07.2010
Revised: 09.10.2010
English version:
Journal of Applied and Industrial Mathematics, 2012, Volume 6, Issue 1, Pages 90–96
DOI: https://doi.org/10.1134/S1990478912010097
Bibliographic databases:
Document Type: Article
UDC: 519.2+621.391
Language: Russian
Citation: A. V. Kel'manov, S. M. Romanchenko, “The approximation algorithm for one problem of searching for subset of vectors”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 61–69; J. Appl. Industr. Math., 6:1 (2012), 90–96
Citation in format AMSBIB
\Bibitem{KelRom11}
\by A.~V.~Kel'manov, S.~M.~Romanchenko
\paper The approximation algorithm for one problem of searching for subset of vectors
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 1
\pages 61--69
\mathnet{http://mi.mathnet.ru/da638}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2847829}
\zmath{https://zbmath.org/?q=an:1249.90189}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 1
\pages 90--96
\crossref{https://doi.org/10.1134/S1990478912010097}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84857671357}
Linking options:
  • https://www.mathnet.ru/eng/da638
  • https://www.mathnet.ru/eng/da/v18/i1/p61
    • This publication is cited in the following 32 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:497
    Full-text PDF :128
    References:52
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024