NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346)

From MaRDI portal
Revision as of 21:45, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
scientific article

    Statements

    NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (English)
    0 references
    0 references
    0 references
    0 references
    11 March 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    partitioning
    0 references
    set of points in Euclidean space
    0 references
    clusters
    0 references
    intracluster quadratic variance
    0 references
    cluster size
    0 references
    NP-completeness
    0 references