Phylogenetic diversity and the maximum coverage problem

DOI10.1016/j.aml.2009.03.017zbMath1171.05377OpenAlexW2073982681MaRDI QIDQ735104

Andreas Spillner, Vincent L. Moulton

Publication date: 14 October 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.03.017

zbMATH Keywords

hypergraphphylogenetic diversitygreedoidmaximum coverage

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (1)

The matroid structure of representative triple sets and triple-closure computation

Cites Work

• A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
• Greedy algorithm compatibility and heavy-set structures
• Gaussian, strong and transversal greedoids
• Optimizing phylogenetic diversity under constraints
• A threshold of ln n for approximating set cover
• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Phylogenetic diversity and the maximum coverage problem