Improved approximations of independent sets in bounded-degree graphs (Q5054761): Difference between revisions

@@ Property / cites work @@
+On Turan's theorem for sparse graphs
@@ Property / cites work: On Turan's theorem for sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Ramsey numbers
@@ Property / cites work: A note on Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved non-approximability results
@@ Property / cites work: Improved non-approximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+Q5536129
@@ Property / cites work: Q5536129 / rank @@
+Normal rank
@@ Property / cites work @@
+Greed is good
@@ Property / cites work: Greed is good / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs
+Normal rank