On Capacitated Set Cover Problems (Q3088080): Difference between revisions

@@ Property / cites work @@
+A unified approach to approximating resource allocation and scheduling
+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 @@
+Q4952606
@@ Property / cites work: Q4952606 / rank @@
+Normal rank
@@ Property / cites work @@
+On Column-Restricted and Priority Covering Integer Programs
+Normal rank
@@ Property / cites work @@
+Q2921762
@@ Property / cites work: Q2921762 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin Packing via Discrepancy of Permutations
@@ Property / cites work: Bin Packing via Discrepancy of Permutations / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Approximating covering integer programs with multiplicity constraints
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Weighted geometric set cover via quasi-uniform sampling
+Normal rank