AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY

DOI10.1142/S1793830910000449zbMath1209.68630OpenAlexW2143587855MaRDI QIDQ3560058

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

Publication date: 19 May 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000449

zbMATH Keywords

computational biologyimplicit set coverinapproximbility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Population dynamics (general) (92D25) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• On approximating four covering and packing problems
• Packing triangles in bounded degree graphs.
• Proof verification and the hardness of approximation problems
• A Parallel Repetition Theorem
• Hardness of Approximation for Vertex-Connectivity Network Design Problems
• Testing for heterogeneity of recombination fraction values in Human Genetics

This page was built for publication: AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY