Bordewich, M. and Semple, C. (2008) 'Nature reserve selection problem : a tight approximation algorithm.', IEEE/ACM transactions on computational biology and bioinformatics., 5 (2). pp. 275-280.
Abstract
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 be conserved so that the phylogenetic diversity of the set of species contained within those regions is maximized. Recently, it has been shown in a paper by Moulton et al. that this problem is NP-hard. In this paper, we establish a tight polynomial-time approximation algorithm for the Nature Reserve Section Problem. Furthermore, we resolve a question on the computational complexity of a related problem left open by Moulton et al.
| Item Type: | Article |
|---|---|
| Full text: | (VoR) Version of Record Download PDF (424Kb) |
| Status: | Peer-reviewed |
| Publisher Web site: | http://dx.doi.org/10.1109/TCBB.2007.70252 |
| Publisher statement: | ©2008 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Date accepted: | No date available |
| Date deposited: | 06 January 2010 |
| Date of first online publication: | April 2008 |
| Date first made open access: | No date available |
Save or Share this output
| Export: | |
| Look up in GoogleScholar |
