Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640)

From MaRDI portal
Revision as of 16:25, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    4 November 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    partitioning
    0 references
    Euclidean space
    0 references
    minimum sum-of-squared distances
    0 references
    NP-hardness
    0 references
    approximation algorithm
    0 references