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
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1134/s0965542519050099 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2949705213 / rank | |||
Normal rank |
Latest revision as of 10:32, 30 July 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
0 references
0 references
0 references