A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(88)90040-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994443724 / rank | |||
Normal rank | |||
Latest revision as of 11:36, 30 July 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
