Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640)
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 7126108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space |
scientific article; zbMATH DE number 7126108 |
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
0 references
0 references
0 references
0.8829254508018494
0 references
0.8636650443077087
0 references
0.8613263368606567
0 references
0.8599699139595032
0 references
0.8417008519172668
0 references
