A bouquet of matroids is a combinatorial structure that generalizes the properties of matroids. Given an independence systemℐ, there exist several bouquets of matroids having the same familyℐ of independent sets. We show that the collection of these geometries forms in general a meet semi-lattice and, in some cases, a lattice (for instance, whenℐ is the family of the stable sets in a graph). Moreover, one of the bouquets that correspond to the highest elements in the meet semi-lattice provides the smallest decomposition ofℐ into matroidal families, such that the rank functions of the different matroids have the same values for common sets. In the last section, we give sharp bounds on the performance of the greedy algorithm, using parameters of some special bouquets in the semi-lattice.
[1]
B. Korte,et al.
An Analysis of the Greedy Heuristic for Independence Systems
,
1978
.
[2]
Gérard Cornuéjols,et al.
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem
,
1984,
Discret. Appl. Math..
[3]
Peter Frankl,et al.
Injection geometries
,
1984,
J. Comb. Theory, Ser. B.
[4]
Peter J. Cameron,et al.
ON PERMUTATION GEOMETRIES
,
1979
.
[5]
Peter Frankl,et al.
On squashed design
,
1986,
Discret. Comput. Geom..
[6]
Peter L. Hammer,et al.
Boolean techniques for matroidal decomposition of independence systems and applications to graphs
,
1985,
Discret. Math..