Precedence-constrained covering problems with multiplicity constraints (Q2085754): Difference between revisions

@@ Property / cites work @@
+Primal-Dual Schema for Capacitated Covering Problems
+Normal rank
@@ Property / cites work @@
+Q4952606
@@ Property / cites work: Q4952606 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
+Normal rank
@@ Property / cites work @@
+The precedence constrained knapsack problem: separating maximally violated inequalities
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for covering/packing integer programs
+Normal rank
@@ Property / cites work @@
+Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for precedence constrained covering problems
+Normal rank
@@ Property / cites work @@
+Approximability of sparse integer programs
@@ Property / cites work: Approximability of sparse integer programs / rank @@
+Normal rank
@@ Property / cites work @@
+Non-approximability results for optimization problems on bounded degree instances
+Normal rank
@@ Property / cites work @@
+On the approximability of average completion time scheduling under precedence constraints.
+Normal rank
@@ Property / cites work @@
+Faces for a linear inequality in 0–1 variables
@@ Property / cites work: Faces for a linear inequality in 0–1 variables / rank @@
+Normal rank