Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859): Difference between revisions

@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221758
@@ Property / cites work: Q3221758 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472486
@@ Property / cites work: Q4472486 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+The importance of being biased
@@ Property / cites work: The importance of being biased / rank @@
+Normal rank
@@ Property / cites work @@
+Greed is good: Approximating independent sets in sparse and bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Steiner and Directed Multicuts
+Normal rank
@@ Property / cites work @@
+Q4737518
@@ Property / cites work: Q4737518 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q4542575
@@ Property / cites work: Q4542575 / rank @@
+Normal rank