A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299): Difference between revisions

A modified greedy algorithm is presented which determines an optimal solution for every weight function if and only if the hereditary set- system is a Gaussian elimination greedoid. This also leads to an algorithmic characterization of strong map relations between matroids.