A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids

DOI10.1016/0166-218X(88)90040-6zbMath0644.05018OpenAlexW1994443724MaRDI QIDQ1102299

Oskar Goecke

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90040-6

zbMATH Keywords

greedy algorithmGaussian elimination greedoid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Critical sets, crowns and local maximum independent sets ⋮ Optimizing phylogenetic diversity under constraints ⋮ Phylogenetic diversity and the maximum coverage problem ⋮ Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-interval greedoids and the transposition property
• Note on Independence Functions
• Greedoids and Linear Objective Functions
• Strong maps of geometries
• Systems of distinct representatives and linear algebra
• Optimal assignments in an ordered set: An application of matroid theory
• Matroids and the greedy algorithm