The authors present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which are called matroid embeddings, complete the partial characterizations of Rado [A note on independent functions, Proc. London Math. Soc., 7 (1957), pp. 300–320], Gale [Optimal assignments in an ordered set, J. Combin. Theory, 4 (1968), pp. 176–180], and Edmonds [Matroids and the greedy algorithm, Math. Programming, 1 (1971), pp. 127–136], (matroids), and of Korte and Lovasz [Greedoids and linear object functions, SIAM J. Alg. Discrete Meth., 5 (1984), pp. 239–248] and [Mathematical structures underlying greedy algorithms, in Fundamentals of Computational Theory, LNCS 177, Springer-Verlag, 1981, pp. 205–209] (greedoids). It is shown that the greedy algorithm optimizes all linear objective functions if and only if the problem structure (phrased in terms of either accessible set systems or hereditary languages) is a matroid embedding. An exact characterization of the ...
[1]
Jack Edmonds,et al.
Matroids and the greedy algorithm
,
1971,
Math. Program..
[2]
D. Gale.
Optimal assignments in an ordered set: An application of matroid theory
,
1968
.
[3]
Ulrich Faigle,et al.
The greedy algorithm for partially ordered sets
,
1979,
Discret. Math..
[4]
László Lovász,et al.
Mathematical Structures Underlying Greedy Algorithms
,
1981,
International Symposium on Fundamentals of Computation Theory.
[5]
R. Rado.
Note on Independence Functions
,
1957
.
[6]
B. Korte,et al.
Greedoids and Linear Objective Functions
,
1984
.
[7]
Oskar Goecke,et al.
A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
,
1988,
Discret. Appl. Math..
[8]
Thomas Lengauer,et al.
Unstructured Path Problems and the Making of Semirings (Preliminary Version)
,
1991,
WADS.