An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem

DOI10.1007/978-3-030-10934-9_10zbMath1468.90109OpenAlexW2910611243MaRDI QIDQ2026155

Alexander Kel'Manov, Artem V. Pyatkin, Sergey Khamidullin, Vladimir Khandeev

Publication date: 18 May 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-10934-9_10

zbMATH Keywords

Euclidean spaceexact algorithmsequenceNP-hard problem2-partitioninteger coordinatesquadratic variancefixed space dimensionlongest subsequencepseudopolynomial running time

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

This page was built for publication: An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem