Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0217595922400097
+Normal rank
@@ Property / OpenAlex ID @@
+W4210901693
@@ Property / OpenAlex ID: W4210901693 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+Local Search Heuristics for <i>k</i>-Median and Facility Location Problems
+Normal rank
@@ Property / cites work @@
+An Improved Approximation for             <i>k</i>             -Median and Positive Correlation in Budgeted Optimization
+Normal rank
@@ Property / cites work @@
+Q2768359
@@ Property / cites work: Q2768359 / rank @@
+Normal rank
@@ Property / cites work @@
+A constant-factor approximation algorithm for the \(k\)-median problem
+Normal rank
@@ Property / cites work @@
+Q5368697
@@ Property / cites work: Q5368697 / rank @@
+Normal rank
@@ Property / cites work @@
+Concept decompositions for large sparse text data using clustering
+Normal rank
@@ Property / cites work @@
+Q4598215
@@ Property / cites work: Q4598215 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607905
@@ Property / cites work: Q4607905 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5875629
@@ Property / cites work: Q5875629 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the \(k\)-means problem with penalties
+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 seeding algorithm for \(k\)-means problem with penalties
+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 @@
+A Bi-Criteria Approximation Algorithm for k-Means
@@ Property / cites work: A Bi-Criteria Approximation Algorithm for k-Means / rank @@
+Normal rank
@@ Property / cites work @@
+On approximate geometric \(k\)-clustering
@@ Property / cites work: On approximate geometric \(k\)-clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Constant approximation for k-median and k-means with outliers via iterative rounding
+Normal rank
@@ Property / cites work @@
+A constant FPT approximation algorithm for hard-capacitated \(k\)-means
+Normal rank
@@ Property / cites work @@
+Local search algorithm for universal facility location problem with linear penalties
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithm for universal facility location problem with linear penalties
+Normal rank
@@ Property / cites work @@
+A local search approximation algorithm for the \(k\)-means problem with penalties
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6053497