On approximation of the submodular set cover problem (Q1969763): Difference between revisions

@@ Property / cites work @@
+Q4252274
@@ Property / cites work: Q4252274 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886039
@@ Property / cites work: Q4886039 / rank @@
+Normal rank
@@ 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 @@
+Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified local ratio approximation of node-deletion problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Set Covering and Vertex Cover Problems
+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 @@
+Improved performance of the greedy algorithm for partial cover
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ Property / Wikidata QID @@
+Q127315951
@@ Property / Wikidata QID: Q127315951 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(99)00045-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1973935176
@@ Property / OpenAlex ID: W1973935176 / rank @@
+Normal rank