Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction (Q1086161)
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: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction |
scientific article; zbMATH DE number 3984981
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction |
scientific article; zbMATH DE number 3984981 |
Statements
Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction (English)
0 references
1987
0 references
This is a correction to a recent paper by the authors [ibid. 7, 251-274 (1984; Zbl 0533.90062)].
0 references
greedy algorithm
0 references
worst case bound
0 references
matroid
0 references
submodular set function
0 references
independence system
0 references
