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

DOI10.1016/0166-218X(88)90040-6MaRDI QIDQ1102299zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

greedy algorithmGaussian elimination greedoid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• A framework for the greedy algorithm
• scientific article; zbMATH DE number 4137538
• Greedoids
• Greedy Families for Linear Objective Functions
• scientific article; zbMATH DE number 3904604

Cites work

• scientific article; zbMATH DE number 3871387 (Why is no real title available?)
• scientific article; zbMATH DE number 4062828 (Why is no real title available?)
• scientific article; zbMATH DE number 3742601 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• Greedoids and Linear Objective Functions
• Matroids and the greedy algorithm
• Non-interval greedoids and the transposition property
• Note on Independence Functions
• Optimal assignments in an ordered set: An application of matroid theory
• Strong maps of geometries
• Systems of distinct representatives and linear algebra

Cited in

(13)

• scientific article; zbMATH DE number 2165210 (Why is no real title available?)
• A greedy algorithm for maximizing a linear objective function
• Phylogenetic diversity and the maximum coverage problem
• Greedy algorithm and symmetric matroids
• Hereditary systems and greedy-type algorithms.
• Greedy algorithm compatibility and heavy-set structures
• Optimizing phylogenetic diversity under constraints
• Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm
• scientific article; zbMATH DE number 4051650 (Why is no real title available?)
• Performance guarantees for greedy algorithms for problems on hereditary systems
• Valuated matroids: A new look at the greedy algorithm
• Weakly greedy algorithm and pair-Delta-matroids
• Critical sets, crowns and local maximum independent sets

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)