Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438)
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: Approximation of min-max and min-max regret versions of some combinatorial optimization problems |
scientific article; zbMATH DE number 5082836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of min-max and min-max regret versions of some combinatorial optimization problems |
scientific article; zbMATH DE number 5082836 |
Statements
Approximation of min-max and min-max regret versions of some combinatorial optimization problems (English)
0 references
9 January 2007
0 references
min-max
0 references
min-max regret
0 references
approximation
0 references
fptas
0 references
shortest path
0 references
minimum spanning tree
0 references
Knapsack
0 references
0 references
0.961207389831543
0 references
0.9478668570518494
0 references
0.9251428842544556
0 references
0.8673359751701355
0 references
