Phylogenetic diversity and the maximum coverage problem (Q735104): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing phylogenetic diversity under constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm compatibility and heavy-set structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian, strong and transversal greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids / rank
 
Normal rank

Latest revision as of 00:59, 2 July 2024

scientific article
Language Label Description Also known as
English
Phylogenetic diversity and the maximum coverage problem
scientific article

    Statements

    Identifiers