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

@@ Property / cites work @@
+Adaptive Sampling for k-Means Clustering
@@ Property / cites work: Adaptive Sampling for k-Means Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+A 3-approximation algorithm for the facility location problem with uniform capacities
+Normal rank
@@ Property / cites work @@
+Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
+Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+Q3601533
@@ Property / cites work: Q3601533 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934696
@@ Property / cites work: Q2934696 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5368726
@@ Property / cites work: Q5368726 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for the constrained \(k\)-means problem
+Normal rank
@@ Property / cites work @@
+Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for capacitated facility location problems
+Normal rank
@@ Property / cites work @@
+Q4598213
@@ Property / cites work: Q4598213 / rank @@
+Normal rank
@@ Property / cites work @@
+A Unified Framework for Clustering Constrained Data without Locality Property
+Normal rank
@@ Property / cites work @@
+Clustering large graphs via the singular value decomposition
+Normal rank
@@ Property / cites work @@
+A PTAS for k-means clustering based on weak coresets
+Normal rank
@@ Property / cites work @@
+Clustering by Passing Messages Between Data Points
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+A local search approximation algorithm for \(k\)-means clustering
+Normal rank
@@ Property / cites work @@
+Analysis of a Local Search Heuristic for Facility Location Problems
+Normal rank
@@ Property / cites work @@
+Improved and simplified inapproximability for \(k\)-means
+Normal rank
@@ Property / cites work @@
+On Uniform Capacitated <i>k</i>-Median Beyond the Natural LP Relaxation
+Normal rank
@@ Property / cites work @@
+Least squares quantization in PCM
@@ Property / cites work: Least squares quantization in PCM / rank @@
+Normal rank
@@ Property / cites work @@
+Solving capacitated clustering problems
@@ Property / cites work: Solving capacitated clustering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated clustering problems by hybrid simulated annealing and tabu search
+Normal rank
@@ Property / cites work @@
+The effectiveness of lloyd-type methods for the k-means problem
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
+Normal rank
@@ Property / cites work @@
+\(k\)-means requires exponentially many iterations even in the plane
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the stochastic fault-tolerant facility location problem
+Normal rank
@@ Property / cites work @@
+A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
+Normal rank

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

Latest revision as of 06:39, 30 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)