Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744): Difference between revisions

@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q5541610
@@ Property / cites work: Q5541610 / rank @@
+Normal rank
@@ Property / cites work @@
+Preserving approximation in the min-weighted set cover problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+Q4228498
@@ Property / cites work: Q4228498 / rank @@
+Normal rank
@@ Property / cites work @@
+Evaluation of reliability bounds by set covering models.
+Normal rank
@@ Property / cites work @@
+Q3824115
@@ Property / cites work: Q3824115 / rank @@
+Normal rank