Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem (Q2284268)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem |
scientific article |
Statements
Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem (English)
0 references
14 January 2020
0 references
Euclidean space
0 references
clustering
0 references
partitioning
0 references
minimum sum-of-squares
0 references
strongly NP-hard problem
0 references
one-dimensional case
0 references
polynomial-time solvability
0 references
0 references
0 references
