Approximation algorithms for diversity-bounded center problems (Q6111979): Difference between revisions

@@ Property / cites work @@
+Q5075746
@@ Property / cites work: Q5075746 / 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 @@
+A constant-factor approximation algorithm for the \(k\)-median problem
+Normal rank
@@ Property / cites work @@
+Matroid and knapsack center problems
@@ Property / cites work: Matroid and knapsack center problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4598215
@@ Property / cites work: Q4598215 / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+Budgeted Red-Blue Median and Its Generalizations
@@ Property / cites work: Budgeted Red-Blue Median and Its Generalizations / rank @@
+Normal rank
@@ Property / cites work @@
+Fair colorful \(k\)-center clustering
@@ Property / cites work: Fair colorful \(k\)-center clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365103
@@ Property / cites work: Q5365103 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
+Normal rank
@@ Property / cites work @@
+A constant FPT approximation algorithm for hard-capacitated \(k\)-means
+Normal rank