Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems (Q3703589)
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: Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems |
scientific article; zbMATH DE number 3930725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems |
scientific article; zbMATH DE number 3930725 |
Statements
Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems (English)
0 references
1985
0 references
worst case analysis
0 references
combinatorial optimization
0 references
heuristics
0 references
Min-max problems on matroids
0 references
greedy type algorithms
0 references
n-enumerative algorithms
0 references
\(\epsilon \) -optimal solutions
0 references
0.7833968997001648
0 references
0.77797532081604
0 references
0.7719112634658813
0 references
