A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128): Difference between revisions

@@ Property / cites work @@
+Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
+Normal rank
@@ Property / cites work @@
+Wavelength Management in WDM Rings to Maximize the Number of Connections
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for partial covering problems
+Normal rank
@@ Property / cites work @@
+Q4886045
@@ Property / cites work: Q4886045 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating k-set cover and complementary graph coloring
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating \(k\)-set packing
+Normal rank
@@ Property / cites work @@
+On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
+Normal rank