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 10:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references