Q4993306 (Q4993306): 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 @@
+Q5502120
@@ Property / cites work: Q5502120 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934696
@@ Property / cites work: Q2934696 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5361265
@@ Property / cites work: Q5361265 / rank @@
+Normal rank
@@ Property / cites work @@
+Center-based clustering under perturbation stability
+Normal rank
@@ Property / cites work @@
+Q5368726
@@ Property / cites work: Q5368726 / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering with Interactive Feedback
@@ Property / cites work: Clustering with Interactive Feedback / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering under approximation stability
@@ Property / cites work: Clustering under approximation stability / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bound instances for \(k\)-means++ in two dimensions
+Normal rank
@@ Property / cites work @@
+A bad instance for \texttt{k-means++}
@@ Property / cites work: A bad instance for \texttt{k-means++} / rank @@
+Normal rank
@@ Property / cites work @@
+The PCP theorem by gap amplification
@@ Property / cites work: The PCP theorem by gap amplification / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for k-means clustering based on weak coresets
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q4937204
@@ Property / cites work: Q4937204 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
+Normal rank
@@ Property / cites work @@
+Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
+Normal rank
@@ Property / cites work @@
+A local search approximation algorithm for \(k\)-means clustering
+Normal rank
@@ Property / cites work @@
+Linear-time approximation schemes for clustering problems in any dimensions
+Normal rank
@@ Property / cites work @@
+Improved and simplified inapproximability for \(k\)-means
+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 @@
+Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
+Normal rank
@@ Property / cites work @@
+The effectiveness of lloyd-type methods for the k-means problem
+Normal rank
@@ Property / cites work @@
+k-means requires exponentially many iterations even in the plane
+Normal rank
@@ Property / cites work @@
+Q5405114
@@ Property / cites work: Q5405114 / rank @@
+Normal rank