Phylogenetic diversity (PD) is a measure of the extent to which different subsets of taxa span an evolutionary tree, and provides a quantitative tool for studying biodiversity conservation. Recently, it was shown that the problem of finding subsets of taxa of given size to maximize PD can be efficiently solved by a greedy algorithm. In this paper, we extend this earlier work, beginning with a m...

In the online bipartite matching problem, vertices in one partition are given up front and vertices in the other partition arrive sequentially. When a vertex arrives, it reveals its neighboring edges and it must be immediately matched or left unmatched. We determine asymptotic matching sizes given by a variety of greedy online matching algorithms on random graphs. On G(n, n, p), we show that an...

In recent years, many test case prioritization (TCP) techniques have been proposed to speed up the process of fault detection. However, little work has taken efficiency problem these into account. this paper, we target Greedy Additional (GA) algorithm, which widely recognized be effective but less efficient, and try improve its while preserving effectiveness. our Accelerated GA (AGA) use some e...