Valuated Matroids - A new Look at the Greedy Algorithm
Séminaire lotharingien de combinatoire, Tome 22 (1989)
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.
@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},
publisher = {mathdoc},
volume = {22},
year = {1989},
url = {http://geodesic.mathdoc.fr/item/SLC_1989_22_a2/}
}
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/