On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2883188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Grouping for Maximum Homogeneity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Clustering with Relaxed Size Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Compatible Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for size constrained 2-clustering in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / 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: Minimum-weight triangulation is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality constrained combinatorial optimization: complexity and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-means requires exponentially many iterations even in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and the Theory of Grouping / rank
 
Normal rank

Latest revision as of 08:13, 15 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of clustering with relaxed size constraints in fixed dimension
scientific article

    Statements

    On the complexity of clustering with relaxed size constraints in fixed dimension (English)
    0 references
    0 references
    0 references
    0 references
    13 March 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric clustering problems
    0 references
    cluster-size constraints
    0 references
    computational complexity
    0 references
    constrained \(k\)-means
    0 references
    0 references
    0 references