Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




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

Avtomatika i Telemekhanika, 2012, Issue 2, Pages 156–162 (Mi at3618)  
This article is cited in 21 scientific papers (total in 21 papers)

Integer Programming Problems

Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems

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

a Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (186 kB) Citations (21)
References:
PDF
HTML
Abstract: We analyze several $NP$-hard problems related to clustering and searching, in a given set of vectors in a Euclidean space, for a subset of vectors of fixed size. An important data mining problem related to sum of squares optimization reduces to these problems. We show pseudopolynomial algorithms that are guaranteed to find an optimum in these problems in case when vector components have integer values and the dimension is fixed.
Presented by the member of Editorial Board: A. I. Kibzun

Received: 06.06.2011
English version:
Automation and Remote Control, 2012, Volume 73, Issue 2, Pages 349–354
DOI: https://doi.org/10.1134/S0005117912020129
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: A. V. Kel'manov, S. M. Romanchenko, “Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems”, Avtomat. i Telemekh., 2012, no. 2, 156–162; Autom. Remote Control, 73:2 (2012), 349–354
Citation in format AMSBIB
\Bibitem{KelRom12}
\by A.~V.~Kel'manov, S.~M.~Romanchenko
\paper Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
\jour Avtomat. i Telemekh.
\yr 2012
\issue 2
\pages 156--162
\mathnet{http://mi.mathnet.ru/at3618}
\transl
\jour Autom. Remote Control
\yr 2012
\vol 73
\issue 2
\pages 349--354
\crossref{https://doi.org/10.1134/S0005117912020129}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000300280000012}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84862139300}
Linking options:
  • https://www.mathnet.ru/eng/at3618
  • https://www.mathnet.ru/eng/at/y2012/i2/p156
    • This publication is cited in the following 21 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:396
    Full-text PDF :75
    References:53
    First page:12
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024