A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
From MaRDI portal
Publication:1102299
DOI10.1016/0166-218X(88)90040-6zbMATH Open0644.05018OpenAlexW1994443724MaRDI QIDQ1102299FDOQ1102299
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong maps of geometries
- Matroids and the greedy algorithm
- Optimal assignments in an ordered set: An application of matroid theory
- Systems of distinct representatives and linear algebra
- Title not available (Why is that?)
- Note on Independence Functions
- Greedoids and Linear Objective Functions
- Non-interval greedoids and the transposition property
- Title not available (Why is that?)
Cited In (13)
- Performance guarantees for greedy algorithms for problems on hereditary systems
- Weakly greedy algorithm and pair-Delta-matroids
- Greedy algorithm and symmetric matroids
- Optimizing phylogenetic diversity under constraints
- Valuated matroids: A new look at the greedy algorithm
- Phylogenetic diversity and the maximum coverage problem
- Critical sets, crowns and local maximum independent sets
- Hereditary systems and greedy-type algorithms.
- Greedy algorithm compatibility and heavy-set structures
- Title not available (Why is that?)
- A greedy algorithm for maximizing a linear objective function
- Title not available (Why is that?)
- Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm
This page was built for publication: A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102299)
