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, 2017, Volume 24, Issue 4, Pages 111–129
DOI: https://doi.org/10.17377/daio.2017.24.541 (Mi da885) 		 
This article is cited in 7 scientific papers (total in 7 papers)

An exact algorithm for finding a vector subset with the longest sum

V. V. Shenmaier

Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
Full-text PDF (396 kB) Citations (7)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2017.24.541
Abstract: We consider the problem: Given a set of $n$ vectors in the $d$-dimensional Euclidean space, find a subset maximizing the length of the sum vector. We propose an algorithm that finds an optimal solution to this problem in time $O(n^{d-1}(d+\log n))$. In particular, if the input vectors lie in a plane then the problem is solvable in almost linear time. Illustr. 2, bibliogr. 14.
Keywords: sum vector, search for a vector subset, Euclidean space, polynomial-time algorithm, optimal solution.
Funding agency Grant number
Russian Science Foundation 16-11-10041
Received: 22.05.2016
Revised: 10.05.2017
English version:
Journal of Applied and Industrial Mathematics, 2017, Volume 11, Issue 4, Pages 584–593
DOI: https://doi.org/10.1134/S1990478917040160
Bibliographic databases:
Document Type: Article
UDC: 519.16
Language: Russian
Citation: V. V. Shenmaier, “An exact algorithm for finding a vector subset with the longest sum”, Diskretn. Anal. Issled. Oper., 24:4 (2017), 111–129; J. Appl. Industr. Math., 11:4 (2017), 584–593
Citation in format AMSBIB
\Bibitem{She17}
\by V.~V.~Shenmaier
\paper An exact algorithm for finding a~vector subset with the longest sum
\jour Diskretn. Anal. Issled. Oper.
\yr 2017
\vol 24
\issue 4
\pages 111--129
\mathnet{http://mi.mathnet.ru/da885}
\crossref{https://doi.org/10.17377/daio.2017.24.541}
\elib{https://elibrary.ru/item.asp?id=30551370}
\transl
\jour J. Appl. Industr. Math.
\yr 2017
\vol 11
\issue 4
\pages 584--593
\crossref{https://doi.org/10.1134/S1990478917040160}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85036473903}
Linking options:
  • https://www.mathnet.ru/eng/da885
  • https://www.mathnet.ru/eng/da/v24/i4/p111
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:360
    Full-text PDF :172
    References:33
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024