An Implicit Cover Problem in Wild Population Study

Details An Implicit Cover Problem in Wild Population Study An Implicit Cover Problem in Wild Population Study

2011-02-27

arxiv.org/abs/1102.5471v1

Discrete Mathematics, Algorithms and Applications, 2 (2), 21-31, 2010

Computer Science

Computational Complexity

11 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Implicit Cover Problem in Wild Population Study does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Implicit Cover Problem in Wild Population Study, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Implicit Cover Problem in Wild Population Study will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53852