Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




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

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2018, Volume 58, Number 12, Pages 2169–2178
DOI: https://doi.org/10.31857/S004446690003560-7 (Mi zvmmf10812) 		 
This article is cited in 2 scientific papers (total in 2 papers)

A randomized algorithm for a sequence 2-clustering problem

A. V. Kel'manovab, S. A. Khamidullina, V. I. Khandeeva

a Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S004446690003560-7
Abstract: We consider a strongly NP-hard problem of partitioning a finite Euclidean sequence into two clusters of given cardinalities minimizing the sum over both clusters of intracluster sums of squared distances from clusters elements to their centers. The center of one cluster is unknown and is defined as the mean value of all points in the cluster. The center of the other cluster is the origin. Additionally, the difference between the indices of two consequent points from the first cluster is bounded from below and above by some constants. A randomized algorithm that finds an approximation solution of the problem in polynomial time for given values of the relative error and failure probability and for an established parameter value is proposed. The conditions are established under which the algorithm is polynomial and asymptotically exact.
Key words: partitioning, sequence, Euclidean space, minimum sum-of-squared distances, NP-hardness, randomized algorithm, asymptotic accuracy.
Funding agency Grant number
Russian Science Foundation 16-11-10041
Received: 26.08.2016
English version:
Computational Mathematics and Mathematical Physics, 2018, Volume 58, Issue 12, Pages 2078–2085
DOI: https://doi.org/10.1134/S0965542518120138
Bibliographic databases:
Document Type: Article
UDC: 519.16:519.85
Language: Russian
Citation: A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, “A randomized algorithm for a sequence 2-clustering problem”, Zh. Vychisl. Mat. Mat. Fiz., 58:12 (2018), 2169–2178; Comput. Math. Math. Phys., 58:12 (2018), 2078–2085
Citation in format AMSBIB
\Bibitem{KelKhaKha18}
\by A.~V.~Kel'manov, S.~A.~Khamidullin, V.~I.~Khandeev
\paper A randomized algorithm for a sequence 2-clustering problem
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2018
\vol 58
\issue 12
\pages 2169--2178
\mathnet{http://mi.mathnet.ru/zvmmf10812}
\crossref{https://doi.org/10.31857/S004446690003560-7}
\elib{https://elibrary.ru/item.asp?id=36759184}
\transl
\jour Comput. Math. Math. Phys.
\yr 2018
\vol 58
\issue 12
\pages 2078--2085
\crossref{https://doi.org/10.1134/S0965542518120138}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000458237300015}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85057742799}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf10812
  • https://www.mathnet.ru/eng/zvmmf/v58/i12/p2169
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024