Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem (Q2284268)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7150939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem |
scientific article; zbMATH DE number 7150939 |
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
0 references
0.9192327857017516
0 references
0.8971326947212219
0 references
0.8343697786331177
0 references
0.8315908312797546
0 references
0.8280149102210999
0 references
