Greedoid

In combinatorics, a greedoid is a type of set system. It rises from the notion of the matroid, which was originally introduced by Whitney in 1935 to study planar graphs and was later used by Edmonds to characterize a class of optimization problems that can be solved by greedy algorithms. Around 1980, Korte and Lovász introduced the greedoid to further generalize this characterization of greedy algorithms; hence the name greedoid. Besides mathematical optimization, greedoids have also been connected to graph theory, language theory, poset theory, and other areas of mathematics.

Related Topics:
Combinatorics - Set system - Matroid - Whitney - Planar graph - Greedy algorithm - Mathematical optimization - Graph theory - Poset - Areas of mathematics

~ ~ ~ ~ ~ ~ ~ ~ ~ ~