## The Greedy Algorithms Class: Formalization, Synthesis and Generalization (1995)

by
Bruno Charlier

Citations: | 1 - 0 self |

### BibTeX

@MISC{Charlier95thegreedy,

author = {Bruno Charlier},

title = {The Greedy Algorithms Class: Formalization, Synthesis and Generalization},

year = {1995}

}

### OpenURL

### Abstract

On the first hand, this report studies the class of Greedy Algorithms in order to find an as systematic as possible strategy that could be applied to the specification of some problems to lead to a correct program solving that problem. On the other hand, the standard formalisms underlying the Greedy Algorithms (matroid, greedoid and matroid embedding) which are dependent on the particular type set are generalized to a formalism independent of any data type based on an algebraic specification setting.