… Coxeter matroids L, the greedy algorithm … greedy result is a bijection between the set W/P
of left cosets and a “concrete” collection A of tuples of subsets of a certain partially ordered set. …

… for generalized matroid-type greedy algorithms proposed in … these general matroids and
classical matroids and provide a … In particular, the family D of ideals of any poset P = (E, ≤) is …

… addition to matroids: branchings in graphs, order ideals in posets, … In this section we will
formulate a greedy algorithm for … those languages on which the greedy algorithm is optimal for all …

… of matroids and look at the notion of duality of matroids. Next, we consider the Greedy Algorithm
… some further generalizations of matroids and their relationship to the Greedy Algorithm. …

… some further generalizations of matroids and their relationship to the greedy algorithm. …
For partially ordered set systems, the greedy algorithm was studied by Faigle [Fai79] who …

… can be defined by the optimality of the greedy algorithm. … the chapter with algorithmic
properties of strong matroid systems. This … defines a greedoid which we call poset greedoid. The …

… is obtained by the intersection of matroids and quasimodular set systems leads to a class
of greedoids which we call trimmed matroids. These are not local posets anymore. Finally, in …

… the various greedy weights are determined by the matroids … matroid , we will define and
describe greedy weights for finite … version of) the poset of flats of the matroid coming from any …

… , matroids have wide applications in diverse fields, particularly in greedy algorithm design. In
… Based on the poset matroid, we define the partial order matroid. The latter can be regarded …

… A supermatroid on a distributive lattice is also called a poset matroid. In 1993 and 1998,
M. … cg-matroids are not greedoids. We show that the greedy algorithm works for strict cg-matroids …