Improved bounds for metric capacitated covering problems (Q6107884): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-022-01084-x
@@ Property / DOI: 10.1007/s00453-022-01084-x / rank @@
-Normal rank
@@ Property / cites work @@
+A 3-approximation algorithm for the facility location problem with uniform capacities
+Normal rank
@@ Property / cites work @@
+Improved Approximation Guarantees for Lower-Bounded Facility Location
+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 @@
+LP-Based Algorithms for Capacitated Facility Location
+Normal rank
@@ Property / cites work @@
+Q5874473
@@ Property / cites work: Q5874473 / rank @@
+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 @@
+Almost optimal set covers in finite VC-dimension
@@ Property / cites work: Almost optimal set covers in finite VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
+Normal rank
@@ Property / cites work @@
+A constant-factor approximation algorithm for the \(k\)-median problem
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for capacitated facility location problems
+Normal rank
@@ Property / cites work @@
+Covering Problems with Hard Capacities
@@ Property / cites work: Covering Problems with Hard Capacities / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921763
@@ Property / cites work: Q2921763 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4598213
@@ Property / cites work: Q4598213 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for vertex cover with hard capacities
+Normal rank
@@ Property / cites work @@
+A PTAS for the cardinality constrained covering with unit balls
+Normal rank
@@ Property / cites work @@
+WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED
@@ Property / cites work: WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative Partial Rounding for Vertex Cover with Hard Capacities
+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 @@
+On Uniform Capacitated <i>k</i>-Median Beyond the Natural LP Relaxation
+Normal rank
@@ Property / cites work @@
+On Uniform Capacitated             <i>k</i>             -Median Beyond the Natural LP Relaxation
+Normal rank
@@ Property / cites work @@
+Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
+Normal rank
@@ Property / cites work @@
+Improved results on geometric hitting set problems
+Normal rank
@@ Property / cites work @@
+Lower-bounded facility location
@@ Property / cites work: Lower-bounded facility location / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ Property / cites work @@
+Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
+Normal rank
@@ Property / DOI @@
+.1007/S00453-022-01084-X
@@ Property / DOI: 10.1007/S00453-022-01084-X / rank @@
+Normal rank