Optimizing Phylogenetic Diversity with Ecological Constraints


Given an edge-weighted tree T with leaf set X, define the weight of a subset S of X as the sum of the edge-weights of the minimal subtree of T connecting the elements in S. It is known that the problem of selecting subsets of X of a given size to maximize this weight can be solved using a greedy algorithm. This optimization problem arises in conservation… (More)


1 Figure or Table