On Approximating an Implicit Cover Problem in Biology (Q3638443): Difference between revisions

@@ Property / author @@
-Mary V. Ashley
@@ Property / author: Mary V. Ashley / rank @@
-Normal rank
@@ Property / author @@
-Tanya Y. Berger-Wolf
@@ Property / author: Tanya Y. Berger-Wolf / rank @@
-Normal rank
@@ Property / author @@
-Q405687
@@ Property / author: Q405687 / rank @@
-Normal rank
@@ Property / author @@
-Q235188
@@ Property / author: Q235188 / rank @@
-Normal rank
@@ Property / author @@
+Mary V. Ashley
@@ Property / author: Mary V. Ashley / rank @@
+Normal rank
@@ Property / author @@
+Tanya Y. Berger-Wolf
@@ Property / author: Tanya Y. Berger-Wolf / rank @@
+Normal rank
@@ Property / author @@
+Wanpracha Art Chaovalitwongse
@@ Property / author: Wanpracha Art Chaovalitwongse / rank @@
+Normal rank
@@ Property / author @@
+Bhaskar Das Gupta
@@ Property / author: Bhaskar Das Gupta / 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.1007/978-3-642-02158-9_6
+Normal rank
@@ Property / OpenAlex ID @@
+W1486063521
@@ Property / OpenAlex ID: W1486063521 / rank @@
+Normal rank
@@ Property / cites work @@
+A simulated annealing algorithm for maximum likelihood pedigree reconstruction
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+On approximating four covering and packing problems
+Normal rank
@@ Property / cites work @@
+Set covering approach for reconstruction of sibling relationships
+Normal rank
@@ Property / cites work @@
+Packing triangles in bounded degree graphs.
@@ Property / cites work: Packing triangles in bounded degree graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Hardness of Approximation for Vertex-Connectivity Network Design Problems
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3638443