Geodesic
The Greedy Algorithm as a Combinatorial Principle
Séminaire lotharingien de combinatoire, Tome 05 (1981)

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

In this note, we want to give an outline how a combinatorial theory including, in particular, matching theory may be based on a very simple combinatorial principle. This principle states that, under certain restrictions, an optimal combinatorial object can be constructed in a straight-forward manner, namely by the "greedy algorithm". 

@article{SLC_1981_05_a10,
     author = {Ulrich Faigle},
     title = {The {Greedy} {Algorithm} as a {Combinatorial} {Principle}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {05},
     year = {1981},
     url = {http://geodesic.mathdoc.fr/item/SLC_1981_05_a10/}
}
TY  - JOUR
AU  - Ulrich Faigle
TI  - The Greedy Algorithm as a Combinatorial Principle
JO  - Séminaire lotharingien de combinatoire
PY  - 1981
VL  - 05
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_1981_05_a10/
ID  - SLC_1981_05_a10
ER  - 
%0 Journal Article
%A Ulrich Faigle
%T The Greedy Algorithm as a Combinatorial Principle
%J Séminaire lotharingien de combinatoire
%D 1981
%V 05
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_1981_05_a10/
%F SLC_1981_05_a10
Ulrich Faigle. The Greedy Algorithm as a Combinatorial Principle. Séminaire lotharingien de combinatoire, Tome 05 (1981). http://geodesic.mathdoc.fr/item/SLC_1981_05_a10/