Faigle, Ulrich

The greedy algorithm as a combinatorial principle

Sémin. Lothar. Comb. 5, B05k, 4 p., electronic only (1981)


Summary: 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".