An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem (Q2026155)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem |
scientific article; zbMATH DE number 7349418
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem |
scientific article; zbMATH DE number 7349418 |
Statements
An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem (English)
0 references
18 May 2021
0 references
Euclidean space
0 references
sequence
0 references
2-partition
0 references
longest subsequence
0 references
quadratic variance
0 references
NP-hard problem
0 references
integer coordinates
0 references
exact algorithm
0 references
fixed space dimension
0 references
pseudopolynomial running time
0 references
0.9681237
0 references
0.8949651
0 references
0.88126445
0 references
0.88046384
0 references
0 references
0.8770863
0 references
0.87341726
0 references
0.87113667
0 references
0.86924595
0 references
