An analysis of the greedy algorithm for the submodular set covering problem (Q1838034)
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: An analysis of the greedy algorithm for the submodular set covering problem |
scientific article; zbMATH DE number 3802803
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analysis of the greedy algorithm for the submodular set covering problem |
scientific article; zbMATH DE number 3802803 |
Statements
An analysis of the greedy algorithm for the submodular set covering problem (English)
0 references
1982
0 references
greedy algorithms
0 references
integer covering
0 references
