Calculating approximation guarantees for partial set cover of pairs (Q1676481): 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 @@
+Clique Cover and Graph Separation
@@ Property / cites work: Clique Cover and Graph Separation / rank @@
+Normal rank
@@ Property / cites work @@
+Pairs Covered by a Sequence of Sets
@@ Property / cites work: Pairs Covered by a Sequence of Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Partial Interval Set Cover – Trade-Offs between Scalability and Optimality
+Normal rank
@@ Property / cites work @@
+Covering Analysis of the Greedy Algorithm for Partial Cover
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Data reduction and exact algorithms for clique cover
+Normal rank
@@ Property / cites work @@
+Q4255028
@@ Property / cites work: Q4255028 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Upper Bounds for Partial Vertex Cover
@@ Property / cites work: Improved Upper Bounds for Partial Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank