Bounds on the Performance of a Greedy Algorithm for Probabilities

DOI10.1287/MOOR.26.2.313.10550MaRDI QIDQ5704041zbMATH OpenOpenAlexFDO

Authors

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.26.2.313.10550

zbMATH Keywords

drug discoverygreedy algorithmmathematical programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• New performance guarantees for the greedy maximization of submodular set functions
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Submodular optimization problems and greedy strategies: a survey
• scientific article; zbMATH DE number 1323125
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem

Cited in

(1)

• Performance analysis of a greedy algorithm for inferring Boolean functions

This page was built for publication: Bounds on the Performance of a Greedy Algorithm for Probabilities

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