PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem (Q6134053): Difference between revisions

@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+Q3115657
@@ Property / cites work: Q3115657 / rank @@
+Normal rank
@@ Property / cites work @@
+Grouping Multidimensional Data
@@ Property / cites work: Grouping Multidimensional Data / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994557
@@ Property / cites work: Q3994557 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+On Grouping for Maximum Homogeneity
@@ Property / cites work: On Grouping for Maximum Homogeneity / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Scaling Algorithms for Network Problems
@@ Property / cites work: Faster Scaling Algorithms for Network Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2998954
@@ Property / cites work: Q2998954 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2-approximation polynomial algorithm for a clustering problem
+Normal rank
@@ Property / cites work @@
+On the complexity of a search for a subset of ``similar'' vectors
+Normal rank
@@ Property / cites work @@
+NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes
+Normal rank
@@ Property / cites work @@
+Q5617409
@@ Property / cites work: Q5617409 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation scheme for a problem of search for a vector subset
+Normal rank