In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary algorithms. An important subclass of such problems is the implicit set cover (or, equivalently, hitting set) problem in which the sets are not given explicitly but rather defined implicitly. For example, the well-known minimum feedback arc set problem is such a problem. In this paper, we consider such a cover problem that arises in the study of wild populations in biology in which the sets are defined implicitly via the Mendelian constraints and prove approximability results for this problem. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Ashley, M. V., Berger-Wolf, T. Y., Chaovalitwongse, W., Dasgupta, B., Khokhar, A., & Sheikh, S. (2009). On approximating an implicit cover problem in biology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5564 LNCS, pp. 43–54). https://doi.org/10.1007/978-3-642-02158-9_6
Mendeley helps you to discover research relevant for your work.