# Nature Reserve Selection Problem: A Tight Approximation Algorithm

@article{Bordewich2008NatureRS,
title={Nature Reserve Selection Problem: A Tight Approximation Algorithm},
author={Magnus Bordewich and Charles Semple},
journal={IEEE/ACM Transactions on Computational Biology and Bioinformatics},
year={2008},
volume={5},
pages={275-280}
}
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set of regions to conserve so that the phylogenetic diversity of the set of species contained within those regions is maximized. Recently, it was shown in a paper by Moulton {\\em et al.} that this problem is NP-hard. In this paper, we establish a tight polynomial-time approximation algorithm for the Nature Reserve… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

## and M

V. Moulton, C. Semple
• Steel, “Optimizing Phylogenetic Diversity under Constraints,” J. Theoretical Biology, vol. 246, pp. 186-194
• 2007
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

## A Threshold of ln n for Approximating Set Cover

• J. ACM
• 1998
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

## Computers and Intractability: A Guide to the Theory of NP-Completeness

VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

## and J

S. Khuller, A. Moss
• Naor, “The Budgeted Maximum Coverage Problem,” Information Processing Letters, vol. 70, pp. 39- 45
• 1999
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL