An Exact Characterization of Greedy Structures


We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the partial characterizations of Rado, Gale, and Edmonds (matroids), and of Korte and Lovasz (greedoids). We show that the greedy algorithm optimizes all linear objective functions if and… (More)
DOI: 10.1137/0406021


2 Figures and Tables

Cite this paper

@inproceedings{Helman1992AnEC, title={An Exact Characterization of Greedy Structures}, author={Paul Helman and Bernard M. E. Moret and Henry D. Shapiro}, booktitle={IPCO}, year={1992} }