A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
Data Structures and Algorithms
2025-11-18 v3
Abstract
In the Generalized Noah's Ark Problem, one is given a phylogenetic tree on a set of species X and a set of conservation projects for each species. Each project comes with a cost and raises the survival probability of the corresponding species. The aim is to select a conservation project for each species such that the total cost of the selected projects does not exceed some given threshold and the expected phylogenetic diversity is as large as possible. We study the complexity of Generalized Noah's Ark Problem and some of its special cases with respect to several parameters related to the input structure, such as the number of different costs, the number of different survival probabilities, or the number of species, |X|.
Cite
@article{arxiv.2307.03518,
title = {A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem},
author = {Christian Komusiewicz and Jannik Schestag},
journal= {arXiv preprint arXiv:2307.03518},
year = {2025}
}