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

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elements of statistical learning. Data mining, inference, and prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data mining. Concepts and techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar \(k\)-means problem is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4181272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum sum of squares clustering in a low dimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s096554251911006x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3014008886 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

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
    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

    Identifiers