Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems (Q3703589): 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.1007/bf01582247 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014999649 / rank | |||
Normal rank | |||
Latest revision as of 08:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems |
scientific article |
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
