Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:45, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space |
scientific article |
Statements
Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (English)
0 references
4 November 2019
0 references
partitioning
0 references
Euclidean space
0 references
minimum sum-of-squared distances
0 references
NP-hardness
0 references
approximation algorithm
0 references
