Approximating Subdense Instances of Covering Problems (Q2840726): Difference between revisions

@@ Property / arXiv ID @@
+.0078
@@ Property / arXiv ID: 1011.0078 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Connected vertex covers in dense graphs
@@ Property / cites work: Connected vertex covers in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner trees in uniformly quasi-bipartite graphs.
+Normal rank
@@ Property / cites work @@
+Q2921716
@@ Property / cites work: Q2921716 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
+Normal rank
@@ Property / cites work @@
+Q4395327
@@ Property / cites work: Q4395327 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank