A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids |
scientific article; zbMATH DE number 4049666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids |
scientific article; zbMATH DE number 4049666 |
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
0.8392341136932373
0 references
0.8236035704612732
0 references
