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

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

Original language	English
Pages (from-to)	363-370
Number of pages	8
Journal	Pattern Recognition and Image Analysis
Volume	28
Issue number	3
DOIs	https://doi.org/10.1134/S1054661818030094
Publication status	Published - 1 Jul 2018

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

ID: 16601993