Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (Q2206419)

From MaRDI portal
Revision as of 17:12, 1 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
Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
scientific article

    Statements

    Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (English)
    0 references
    0 references
    0 references
    0 references
    22 October 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    Euclidean space
    0 references
    balanced partition
    0 references
    quadratic variance
    0 references
    variance normalized by cluster size
    0 references
    size-weighted variance
    0 references
    NP-completeness
    0 references