Loading [MathJax]/jax/output/SVG/config.js
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, 2013, Volume 53, Number 1, Pages 143–153
DOI: https://doi.org/10.7868/S0044466913010055
(Mi zvmmf9800)
 

This article is cited in 6 scientific papers (total in 6 papers)

Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов

A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Full-text PDF (227 kB) Citations (6)
References:
Received: 13.02.2012
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin, “Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов”, Zh. Vychisl. Mat. Mat. Fiz., 53:1 (2013), 143–153
Citation in format AMSBIB
\Bibitem{KelRomKha13}
\by A.~V.~Kel'manov, S.~M.~Romanchenko, S.~A.~Khamidullin
\paper Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2013
\vol 53
\issue 1
\pages 143--153
\mathnet{http://mi.mathnet.ru/zvmmf9800}
\crossref{https://doi.org/10.7868/S0044466913010055}
\elib{https://elibrary.ru/item.asp?id=18446753}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf9800
  • https://www.mathnet.ru/eng/zvmmf/v53/i1/p143
  • This publication is cited in the following 6 articles:
    1. Kel'manov A. Khamidullin S. Khandeev V. Pyatkin A., “Exact Algorithms For Two Integer-Valued Problems of Searching For the Largest Subset and Longest Subsequence”, Ann. Math. Artif. Intell., 88:1-3 (2020), 157–168  crossref  isi
    2. A. R. Aydinyan, O. L. Tsvetkova, “The cluster algorithms for solving problems with asymmetric proximity measures”, Num. Anal. Appl., 11:2 (2018), 99–107  mathnet  crossref  crossref  isi  elib  elib
    3. A. V. Kelmanov, S. M. Romanchenko, S. A. Khamidullin, “An approximation scheme for a problem of finding a subsequence”, Num. Anal. Appl., 10:4 (2017), 313–323  mathnet  crossref  crossref  isi  elib
    4. A. Kel'manov, “Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence”, 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON, IEEE, 2017, 87–90  crossref  isi
    5. A. V. Kel'manov, V. I. Khandeev, “A randomized algorithm for two-cluster partition of a set of vectors”, Comput. Math. Math. Phys., 55:2 (2015), 330–339  mathnet  crossref  crossref  mathscinet  isi  elib  elib
    6. A. V. Kel'manov, V. I. Khandeev, “An exact pseudopolynomial algorithm for a bi-partitioning problem”, J. Appl. Industr. Math., 9:4 (2015), 497–502  mathnet  crossref  crossref  mathscinet  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Statistics & downloads:
    Abstract page:474
    Full-text PDF :132
    References:78
    First page:13
     
      Contact us:
    math-net2025_03@mi-ras.ru
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025