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, 2009, Volume 16, Issue 6, Pages 68–73 (Mi da595)  
This article is cited in 11 scientific papers (total in 11 papers)

On the complexity of the maximum sum length vectors subset choice problem

A. V. Pyatkinab

a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (220 kB) Citations (11)
References:
PDF
HTML
Abstract: The maximum sum length vectors subset choice problem is considered. In the case of the fixed dimension of the space this problem is polynomially solvable. It is proved that the problem is NP-hard if the dimension of the space is a part of input. Bibl. 6.
Keywords: vectors sum problem, complexity, NP-completeness.
Received: 04.08.2009
English version:
Journal of Applied and Industrial Mathematics, 2010, Volume 4, Issue 4, Pages 549–552
DOI: https://doi.org/10.1134/S1990478910040095
Bibliographic databases:
UDC: 519.2+621.391
Language: Russian
Citation: A. V. Pyatkin, “On the complexity of the maximum sum length vectors subset choice problem”, Diskretn. Anal. Issled. Oper., 16:6 (2009), 68–73; J. Appl. Industr. Math., 4:4 (2010), 549–552
Citation in format AMSBIB
\Bibitem{Pya09}
\by A.~V.~Pyatkin
\paper On the complexity of the maximum sum length vectors subset choice problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 6
\pages 68--73
\mathnet{http://mi.mathnet.ru/da595}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2649143}
\zmath{https://zbmath.org/?q=an:1249.68083}
\elib{https://elibrary.ru/item.asp?id=13008194}
\transl
\jour J. Appl. Industr. Math.
\yr 2010
\vol 4
\issue 4
\pages 549--552
\crossref{https://doi.org/10.1134/S1990478910040095}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-78650071243}
Linking options:
  • https://www.mathnet.ru/eng/da595
  • https://www.mathnet.ru/eng/da/v16/i6/p68
    • This publication is cited in the following 11 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:407
    Full-text PDF :95
    References:43
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024