An Exact Algorithm of Searching for the Largest Cluster in an Integer-Valued Problem of 2-Partitioning a Sequence

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

Original language	English
Pages (from-to)	703-711
Number of pages	9
Journal	Pattern Recognition and Image Analysis
Volume	28
Issue number	4
DOIs	https://doi.org/10.1134/S105466181804017X
Publication status	Published - 1 Oct 2018

2-partition, Euclidean space, exact algorithm, fixed space dimension, integer coordinates, longest subsequence, NP-hard problem, pseudopolynomial running time, quadratic scattering, sequence, similar elements, time-series analysis

ID: 17831649