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, 2015, Volume 22, Issue 3, Pages 5–17
DOI: https://doi.org/10.17377/daio.2015.22.465 (Mi da816) 		 
This article is cited in 3 scientific papers (total in 3 papers)

A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum

E. Kh. Gimadia, I. A. Rykovb

a Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
Full-text PDF (290 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2015.22.465
Abstract: We present a randomized approximation algorithm for the problem of finding a subset of a finite set of vectors in the Euclidean space with the maximal norm of the sum vector. We show that with an appropriate choice of parameters, the algorithm is polynomial for the problem with any fixed dimension and asymptotically optimal. Il. 1, bibliogr. 18.
Keywords: search for vector subset, randomized algorithm, asymptotical exactness.
Received: 21.10.2014
Revised: 02.03.2015
English version:
Journal of Applied and Industrial Mathematics, 2015, Volume 9, Issue 3, Pages 351–357
DOI: https://doi.org/10.1134/S1990478915030060
Bibliographic databases:
Document Type: Article
UDC: 519.174
Language: Russian
Citation: E. Kh. Gimadi, I. A. Rykov, “A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum”, Diskretn. Anal. Issled. Oper., 22:3 (2015), 5–17; J. Appl. Industr. Math., 9:3 (2015), 351–357
Citation in format AMSBIB
\Bibitem{GimRyk15}
\by E.~Kh.~Gimadi, I.~A.~Rykov
\paper A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 3
\pages 5--17
\mathnet{http://mi.mathnet.ru/da816}
\crossref{https://doi.org/10.17377/daio.2015.22.465}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3443295}
\elib{https://elibrary.ru/item.asp?id=23859889}
\transl
\jour J. Appl. Industr. Math.
\yr 2015
\vol 9
\issue 3
\pages 351--357
\crossref{https://doi.org/10.1134/S1990478915030060}
Linking options:
  • https://www.mathnet.ru/eng/da816
  • https://www.mathnet.ru/eng/da/v22/i3/p5
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:341
    Full-text PDF :61
    References:51
    First page:13
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024