On the geometric structure of independence systems
- 52 Downloads
- 3 Citations
Abstract
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.
Key words
Independence system bouquet of matroids matroid the greedy algorithmPreview
Unable to display preview. Download preview PDF.
References
- [1]U. Baumgarten, “Worst-case—Abschätzung für die Greedy-Heuristic auf monotonen Mengensystemen,” Working Paper, Institut für Ökonometrie und Operations Research, University Bonn (1976).Google Scholar
- [2]C. Benzaken and P.L. Hammer, “Boolean techniques for matroidal decomposition of independence systems and applications to graphs,”Discrete Mathematics 56 (1985) 7–34.Google Scholar
- [3]P.J. Cameron and M. Deza, “On permutation geometries,”Journal of London Mathematical Society 20(3) (1979) 373–386.Google Scholar
- [4]M. Conforti and G. Cornuéjols, “Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem,”Discrete Applied Mathematics 7 (1984) 251–274.Google Scholar
- [5]M. Deza and P. Frankl, “Injection geometries,”Journal of Combinatorial Theory. Series B 36 (1984) 31–40.Google Scholar
- [6]M. Deza and P. Frankl, On squashed designs,Discrete Computational Geometry 1 (1986) 379–390.Google Scholar
- [7]D. Hausmann and B. Korte, “An analysis of the greedy heuristic for independence systems,”Annals of Discrete Mathematics 2 (1978) 65–74.Google Scholar
- [8]M. Laurent, “Squashed geometries: algebraic and algorithmic aspects,” Doctorat thesis, University of Paris VII (1986).Google Scholar
- [9]D. Welsh,Matroid Theory (Academic Press, New York, 1976).Google Scholar