On the geometric structure of independence systems

DOI10.1007/BF01589106zbMath0682.90073OpenAlexW2000539381MaRDI QIDQ1824559

Michele Conforti, Monique Laurent

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589106

zbMATH Keywords

greedy algorithmindependence systemsharp boundsBouquet of matroids

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Bouquets of maroids, d-injection geometries and diagrams, Minimum partition of an independence system into independent sets, Bouquets of geometric lattices: Some algebraic and topological aspects

Cites Work

• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Injection geometries
• Boolean techniques for matroidal decomposition of independence systems and applications to graphs
• On squashed designs
• On Permutation Geometries
• An Analysis of the Greedy Heuristic for Independence Systems