An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Adaptive Sampling for k-Means Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-approximation algorithm for the facility location problem with uniform capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms / 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: Q3601533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the constrained \(k\)-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for Clustering Constrained Data without Locality Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large graphs via the singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for k-means clustering based on weak coresets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering by Passing Messages Between Data Points / 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: A local search approximation algorithm for \(k\)-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Local Search Heuristic for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved and simplified inapproximability for \(k\)-means / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Uniform Capacitated <i>k</i>-Median Beyond the Natural LP Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effectiveness of lloyd-type methods for the k-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties / 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: An approximation algorithm for the stochastic fault-tolerant facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem / rank
 
Normal rank

Latest revision as of 06:39, 30 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for the uniform capacitated \(k\)-means problem
scientific article

    Statements

    An approximation algorithm for the uniform capacitated \(k\)-means problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2022
    0 references
    \(k\)-means
    0 references
    uniform capacitated
    0 references
    approximation algorithm
    0 references
    local search
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers