Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2007.02.036
@@ Property / DOI: 10.1016/j.tcs.2007.02.036 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.02.036
+Normal rank
@@ Property / OpenAlex ID @@
+W2065694619
@@ Property / OpenAlex ID: W2065694619 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2007.02.036
@@ Property / DOI: 10.1016/J.TCS.2007.02.036 / rank @@
+Normal rank