A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q226827 |
||
| Property / reviewed by | |||
| Property / reviewed by: András Recski / rank | |||
Revision as of 13:52, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids |
scientific article |
Statements
A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (English)
0 references
1988
0 references
A modified greedy algorithm is presented which determines an optimal solution for every weight function if and only if the hereditary set- system is a Gaussian elimination greedoid. This also leads to an algorithmic characterization of strong map relations between matroids.
0 references
greedy algorithm
0 references
Gaussian elimination greedoid
0 references
