Q5002778 (Q5002778): Difference between revisions

@@ Property / cites work @@
+A 3-approximation algorithm for the facility location problem with uniform capacities
+Normal rank
@@ Property / cites work @@
+Achieving anonymity via clustering
@@ Property / cites work: Achieving anonymity via clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
+Normal rank
@@ Property / cites work @@
+Centrality of trees for capacitated \(k\)-center
@@ Property / cites work: Centrality of trees for capacitated \(k\)-center / rank @@
+Normal rank
@@ Property / cites work @@
+Local Search Heuristics for <i>k</i>-Median and Facility Location Problems
+Normal rank
@@ Property / cites work @@
+A 5-Approximation for Capacitated Facility Location
+Normal rank
@@ Property / cites work @@
+How to Allocate Network Centers
@@ Property / cites work: How to Allocate Network Centers / 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 \(k\)-median problem
+Normal rank
@@ Property / cites work @@
+Q2768359
@@ Property / cites work: Q2768359 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid and knapsack center problems
@@ Property / cites work: Matroid and knapsack center problems / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Factor Approximation for Capacitated k-Center with Outliers
+Normal rank
@@ Property / cites work @@
+Capacitated center problems with two-sided bounds and outliers
+Normal rank
@@ Property / cites work @@
+Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
+Normal rank
@@ Property / cites work @@
+A Unified Framework for Clustering Constrained Data without Locality Property
+Normal rank
@@ Property / cites work @@
+Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+Greedy Strikes Back: Improved Facility Location Algorithms
+Normal rank
@@ Property / cites work @@
+Easy and hard bottleneck location problems
@@ Property / cites work: Easy and hard bottleneck location problems / rank @@
+Normal rank
@@ Property / cites work @@
+A new greedy approach for facility location problems
+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 @@
+Fault tolerant \(K\)-center problems
@@ Property / cites work: Fault tolerant \(K\)-center problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Capacitated <i>K</i>-Center Problem
@@ Property / cites work: The Capacitated <i>K</i>-Center Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of a Local Search Heuristic for Facility Location Problems
+Normal rank
@@ Property / cites work @@
+Clustering with Diversity
@@ Property / cites work: Clustering with Diversity / rank @@
+Normal rank
@@ Property / cites work @@
+A 1.488 approximation algorithm for the uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Approximating $k$-Median via Pseudo-Approximation
@@ Property / cites work: Approximating $k$-Median via Pseudo-Approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526991
@@ Property / cites work: Q4526991 / rank @@
+Normal rank