On Approximating an Implicit Cover Problem in Biology

DOI10.1007/978-3-642-02158-9_6zbMath1246.90126OpenAlexW1486063521MaRDI QIDQ3638443

Saad Sheikh, Ashfaq A. Khokhar, Tanya Y. Berger-Wolf, Mary V. Ashley, Bhaskar Das Gupta, Wanpracha Art Chaovalitwongse

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_6

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Population dynamics (general) (92D25) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• A simulated annealing algorithm for maximum likelihood pedigree reconstruction
• On approximating four covering and packing problems
• Optimization, approximation, and complexity classes
• Packing triangles in bounded degree graphs.
• New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers
• Proof verification and the hardness of approximation problems
• A threshold of ln n for approximating set cover
• A Parallel Repetition Theorem
• Hardness of Approximation for Vertex-Connectivity Network Design Problems
• Set covering approach for reconstruction of sibling relationships

This page was built for publication: On Approximating an Implicit Cover Problem in Biology