Recoverable Values for Independent Sets (Q3012827): Difference between revisions

@@ Property / cites work @@
+Q3002828
@@ Property / cites work: Q3002828 / rank @@
+Normal rank
@@ Property / cites work @@
+On approximation properties of the independent set problem for low degree graphs
+Normal rank
@@ Property / cites work @@
+Structural Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+PASS approximation: a framework for analyzing and designing heuristics
+Normal rank
@@ Property / cites work @@
+Recoverable Values for Independent Sets
@@ Property / cites work: Recoverable Values for Independent Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the independence number in terms of the degrees
+Normal rank
@@ Property / cites work @@
+Q5365143
@@ Property / cites work: Q5365143 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+Approximations of Weighted Independent Set and Hereditary Subset Problems
+Normal rank
@@ Property / cites work @@
+Greed is good: Approximating independent sets in sparse and bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+A note on greedy algorithms for the maximum weighted independent set problem
+Normal rank