Improved and simplified inapproximability for \(k\)-means (Q506167): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2016.11.009
@@ Property / DOI: 10.1016/j.ipl.2016.11.009 / rank @@
-Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+Q5368726
@@ Property / cites work: Q5368726 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+A unified framework for approximating and clustering data
+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 @@
+Least squares quantization in PCM
@@ Property / cites work: Least squares quantization in PCM / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar k-Means Problem is NP-Hard
@@ Property / cites work: The Planar k-Means Problem is NP-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2016.11.009
@@ Property / DOI: 10.1016/J.IPL.2016.11.009 / rank @@
+Normal rank