Phylogenetic diversity and the maximum coverage problem
From MaRDI portal
Publication:735104
DOI10.1016/J.AML.2009.03.017zbMATH Open1171.05377OpenAlexW2073982681MaRDI QIDQ735104FDOQ735104
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
Recommendations
Cites Work
- A threshold of ln n for approximating set cover
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Optimizing phylogenetic diversity under constraints
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
- 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
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)
