Geodesic
Valuated Matroids - A new Look at the Greedy Algorithm
Séminaire lotharingien de combinatoire, Tome 22 (1989) 
Andreas W. M. Dress; Walter Wenzel. Valuated Matroids - A new Look at the Greedy Algorithm. Séminaire lotharingien de combinatoire, Tome 22 (1989). http://geodesic.mathdoc.fr/item/SLC_1989_22_a2/
@article{SLC_1989_22_a2,
     author = {Andreas W. M. Dress and Walter Wenzel},
     title = {Valuated {Matroids} - {A} new {Look} at the {Greedy} {Algorithm}},
     journal = {S\'eminaire lotharingien de combinatoire},
     year = {1989},
     volume = {22},
     url = {http://geodesic.mathdoc.fr/item/SLC_1989_22_a2/}
}
TY  - JOUR
AU  - Andreas W. M. Dress
AU  - Walter Wenzel
TI  - Valuated Matroids - A new Look at the Greedy Algorithm
JO  - Séminaire lotharingien de combinatoire
PY  - 1989
VL  - 22
UR  - http://geodesic.mathdoc.fr/item/SLC_1989_22_a2/
ID  - SLC_1989_22_a2
ER  - 
%0 Journal Article
%A Andreas W. M. Dress
%A Walter Wenzel
%T Valuated Matroids - A new Look at the Greedy Algorithm
%J Séminaire lotharingien de combinatoire
%D 1989
%V 22
%U http://geodesic.mathdoc.fr/item/SLC_1989_22_a2/
%F SLC_1989_22_a2

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

In this note we study a variant of the greedy algorithm for weight functions defined on the system of m-subsets of a given set E and 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.