Q5009501 (Q5009501): Difference between revisions

@@ Property / cites work @@
+Outlier Analysis
@@ Property / cites work: Outlier Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
+Normal rank
@@ Property / cites work @@
+Algorithms for stable and perturbation-resilient problems
+Normal rank
@@ Property / cites work @@
+Q4537730
@@ Property / cites work: Q4537730 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934696
@@ Property / cites work: Q2934696 / 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 @@
+Improved Spectral-Norm Bounds for Clustering
@@ Property / cites work: Improved Spectral-Norm Bounds for Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633921
@@ Property / cites work: Q4633921 / rank @@
+Normal rank
@@ Property / cites work @@
+k-Center Clustering Under Perturbation Resilience
@@ Property / cites work: k-Center Clustering Under Perturbation Resilience / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering under Perturbation Resilience
@@ Property / cites work: Clustering under Perturbation Resilience / rank @@
+Normal rank
@@ Property / cites work @@
+On the practically interesting instances of MAXCUT
+Normal rank
@@ Property / cites work @@
+Are Stable Instances Easy?
@@ Property / cites work: Are Stable Instances Easy? / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Approximation for             <i>k</i>             -Median and Positive Correlation in Budgeted Optimization
+Normal rank
@@ Property / cites work @@
+Q4598206
@@ Property / cites work: Q4598206 / rank @@
+Normal rank
@@ Property / cites work @@
+A constant-factor approximation algorithm for the             <i>k</i>             -median problem (extended abstract)
+Normal rank
@@ Property / cites work @@
+Q2768359
@@ Property / cites work: Q2768359 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579385
@@ Property / cites work: Q3579385 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymmetric             <i>k</i>             -center is log             <sup>*</sup>             <i>n</i>             -hard to approximate
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+Normal rank
@@ Property / cites work @@
+Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
+Normal rank
@@ Property / cites work @@
+Constant approximation for k-median and k-means with outliers via iterative rounding
+Normal rank
@@ Property / cites work @@
+Least squares quantization in PCM
@@ Property / cites work: Least squares quantization in PCM / rank @@
+Normal rank
@@ Property / cites work @@
+Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut
+Normal rank