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, 2012, Volume 19, Issue 3, Pages 27–38 (Mi da688)  
This article is cited in 9 scientific papers (total in 9 papers)

Approximation algorithms for some NP-hard problems of searching a vectors subsequence

A. V. Kel'manovab, S. M. Romanchenkoa, S. A. Khamidullina

a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (267 kB) Citations (9)
References:
PDF
HTML
Abstract: Some NP-hard problems of searching a subsequence in a finite sequence of Euclidean vectors are studied. It is assumed that the desired subsequence has a fixed number of vectors which are mutually close under the criterion of minimum sum of squared distances. Moreover, there is an additional requirement that the difference between the numbers of any two consecutive vectors must lie between two given constants. Some effective 2-approximation algorithms for these problems are presented. Bibliogr. 11.
Keywords: searching a vectors subsequence, minimum sum-of-squared distances, clustering, NP-hardness, effective approximation algorithm.
Received: 11.08.2011
Revised: 07.11.2011
English version:
Journal of Applied and Industrial Mathematics, 2012, Volume 6, Issue 4, Pages 443–450
DOI: https://doi.org/10.1134/S1990478912040059
Bibliographic databases:
Document Type: Article
UDC: 519.2+621.391
Language: Russian
Citation: A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin, “Approximation algorithms for some NP-hard problems of searching a vectors subsequence”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 27–38; J. Appl. Industr. Math., 6:4 (2012), 443–450
Citation in format AMSBIB
\Bibitem{KelRomKha12}
\by A.~V.~Kel'manov, S.~M.~Romanchenko, S.~A.~Khamidullin
\paper Approximation algorithms for some NP-hard problems of searching a~vectors subsequence
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 3
\pages 27--38
\mathnet{http://mi.mathnet.ru/da688}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2986639}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 4
\pages 443--450
\crossref{https://doi.org/10.1134/S1990478912040059}
Linking options:
  • https://www.mathnet.ru/eng/da688
  • https://www.mathnet.ru/eng/da/v19/i3/p27
    • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024