arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.5471cs.CCcs.DSq-bio.PE
收藏

野生种群研究中的隐覆盖问题

An Implicit Cover Problem in Wild Population Study

Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Chaovalitwongse, Bhaskar DasGupta, Ashfaq Khokhar, Saad Sheikh

摘要:

在隐式组合优化问题中,约束不是显式枚举的,而是通过等式、其他约束或辅助算法隐式地陈述的。这类问题的一个重要子类是隐式集合覆盖(或等价地,命中集)问题,其中集合不是显式给出的,而是隐式定义的。在本文中,我们考虑这样的覆盖问题,在生物学中的野生种群的研究中出现的集合定义隐含通过孟德尔约束,并证明这个问题的逼近结果。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑