An Approximation Scheme for the Problem of Finding a Subsequence › Research Explorer

Novosibirsk State University's Research Portal

An Approximation Scheme for the Problem of Finding a Subsequence

Research output: Contribution to journal › Article › peer-review

Theoretical Cybernetics Section

DOI

https://doi.org/10.1134/S1995423917040036
Final published version

A. V. Kel’manov
S. M. Romanchenko
S. A. Khamidullin

Original language	English
Pages (from-to)	313-323
Number of pages	11
Journal	Numerical Analysis and Applications
Volume	10
Issue number	4
DOIs	https://doi.org/10.1134/S1995423917040036
Publication status	Published - 1 Oct 2017

OECD FOS+WOS

Research areas

Euclidean space, FPTAS, minimum sum of squared distances, NP-hardness, sequence

ID: 10342626