The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension (Q5214428)
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 7165073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension |
scientific article; zbMATH DE number 7165073 |
Statements
The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension (English)
0 references
7 February 2020
0 references
minimum sum-of-squares clustering
0 references
Euclidean space
0 references
strongly NP-hard problem
0 references
one-dimensional case
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0.8632275
0 references
0 references
0 references
0.8500031
0 references
0.8478688
0 references
0.8458264
0 references
0 references
0.83925474
0 references
0.8389002
0 references
