Phylogenetic diversity and the maximum coverage problem

DOI10.1016/J.AML.2009.03.017MaRDI QIDQ735104zbMATH OpenOpenAlexFDO

Authors Andreas Spillner, Vincent 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)

Recommendations

• Optimizing phylogenetic diversity with ecological constraints
• Optimizing phylogenetic diversity under constraints
• Optimizing phylogenetic diversity across two trees
• scientific article; zbMATH DE number 1953104
• scientific article; zbMATH DE number 1323125

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
• A threshold of ln n for approximating set cover
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Gaussian, strong and transversal greedoids
• Greedy algorithm compatibility and heavy-set structures
• Optimizing phylogenetic diversity under constraints
• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem

Cited in

(5)

• On Approximating an Implicit Cover Problem in Biology
• Phylogenetic flexibility via Hall-type inequalities and submodularity
• The matroid structure of representative triple sets and triple-closure computation
• Optimizing phylogenetic diversity under constraints
• Optimizing phylogenetic diversity with ecological constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735104)