Approximating k-set cover and complementary graph coloring (Q4645918): Difference between revisions

@@ Property / cites work @@
+Q3128896
@@ Property / cites work: Q3128896 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation results for the minimum graph coloring problem
+Normal rank
@@ Property / cites work @@
+A modified greedy heuristic for the set covering problem with improved worst case bound
+Normal rank
@@ Property / cites work @@
+Q4886045
@@ Property / cites work: Q4886045 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the number of unused colors in the vertex coloring problem
+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 @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank