The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms (Q3668868)
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: The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms |
scientific article; zbMATH DE number 3823142
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms |
scientific article; zbMATH DE number 3823142 |
Statements
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms (English)
0 references
1983
0 references
random trees
0 references
asymptotical estimates
0 references
analysis of algorithms
0 references
set- covering
0 references
complexity bounds
0 references
worst case behavior
0 references
probabilistic behavior
0 references
