Approximation hardness of dominating set problems in bounded degree graphs (Q958303): Difference between revisions

@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation hardness of edge dominating set problems
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+A new multilayered PCP and the hardness of hypergraph vertex cover
+Normal rank
@@ Property / cites work @@
+The importance of being biased
@@ Property / cites work: The importance of being biased / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum induced matching problem
+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 @@
+A short note on the approximability of the maximum leaves spanning tree problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Approximating the minimum maximal independence number
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating the minimum independent dominating set
+Normal rank
@@ Property / cites work @@
+Bipartite Domination and Simultaneous Matroid Covers
+Normal rank
@@ Property / cites work @@
+Non-approximability results for optimization problems on bounded degree instances
+Normal rank
@@ Property / cites work @@
+Q4944970
@@ Property / cites work: Q4944970 / rank @@
+Normal rank