Séminaire Lotharingien de Combinatoire, B22b (1989), 7
[Formerly: Publ. I.R.M.A. Strasbourg, 1990, 414/S-22, p.
Andreas W. M. Dress and Walter Wenzel
- A new Look at the Greedy Algorithm
In this note we study a variant of the greedy algorithm
functions defined on the system of m-subsets of a given set
characterize completely those classes of weight functions for which this
algorithm works. Well known examples come from matroid theory, new ones
come from valuation theory.
The following versions are available: