A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements

A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements Full article

Journal

Pattern Recognition and Image Analysis
ISSN: 1054-6618 , E-ISSN: 1555-6212

Output data

Year: 2018, Volume: 28, Number: 3, Pages: 363-370 Pages count : 8 DOI: 10.1134/s1054661818030094

Tags

Euclidean space; longest subsequence; NP-hard problem; polynomial-time approximation algorithm; quadratic scatter; similar elements; time-series analysis

Authors

Kel’manov A.V. ^1,2 , Khamidullin S.A. ¹ , Khandeev V.I. ¹ , Pyatkin A.V. ¹ , Shamardin Yu.V. ¹ , Shenmaier V.V. ¹

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Kel’manov A.V. , Khamidullin S.A. , Khandeev V.I. , Pyatkin A.V. , Shamardin Y.V. , Shenmaier V.V.
A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements
Pattern Recognition and Image Analysis. 2018. V.28. N3. P.363-370. DOI: 10.1134/s1054661818030094 Scopus OpenAlex

Scopus:	2-s2.0-85053480541
OpenAlex:	W2890007239

Пока нет цитирований