The Planar k-Means Problem is NP-Hard (Q3605504): Difference between revisions

@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method
+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 @@
+Approximation schemes for clustering problems
@@ Property / cites work: Approximation schemes for clustering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering large graphs via the singular value decomposition
+Normal rank
@@ Property / cites work @@
+On Metric Clustering to Minimize the Sum of Radii
@@ Property / cites work: On Metric Clustering to Minimize the Sum of Radii / rank @@
+Normal rank
@@ Property / cites work @@
+How fast is the \(k\)-means method?
@@ Property / cites work: How fast is the \(k\)-means method? / rank @@
+Normal rank
@@ Property / cites work @@
+A local search approximation algorithm for \(k\)-means clustering
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+Least squares quantization in PCM
@@ Property / cites work: Least squares quantization in PCM / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+The effectiveness of lloyd-type methods for the k-means problem
+Normal rank
@@ Property / cites work @@
+Universality considerations in VLSI circuits
@@ Property / cites work: Universality considerations in VLSI circuits / rank @@
+Normal rank