\(O(f)\) bi-criteria approximation for capacitated covering with hard capacities (Q1741845): Difference between revisions

@@ Property / cites work @@
+A linear-time approximation algorithm for the weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+Approximation of Partial Capacitated Vertex Cover
@@ Property / cites work: Approximation of Partial Capacitated Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Covering Problems with Hard Capacities
@@ Property / cites work: Covering Problems with Hard Capacities / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for vertex cover with hard capacities
+Normal rank
@@ Property / cites work @@
+A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
+Normal rank
@@ Property / cites work @@
+Capacitated vertex covering
@@ Property / cites work: Capacitated vertex covering / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Set Covering and Vertex Cover Problems
+Normal rank
@@ Property / cites work @@
+Iterative Partial Rounding for Vertex Cover with Hard Capacities
+Normal rank
@@ Property / cites work @@
+Capacitated domination: problem complexity and approximation algorithms
+Normal rank
@@ Property / cites work @@
+Capacitated domination problem
@@ Property / cites work: Capacitated domination problem / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Set Cover Revisited: Hypergraph Cover with Hard Capacities
+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