Approximating maximum independent sets by excluding subgraphs (Q1196452): Difference between revisions

@@ Property / cites work @@
+A note on Ramsey numbers
@@ Property / cites work: A note on Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3337224
@@ Property / cites work: Q3337224 / rank @@
+Normal rank
@@ Property / cites work @@
+A better performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating the independent set problem
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+Q5759552
@@ Property / cites work: Q5759552 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5732334
@@ Property / cites work: Q5732334 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Ramsey numbers and an approximation algorithm for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Improving the performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank