On the approximability of minmax (regret) network optimization problems (Q976089)
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: On the approximability of minmax (regret) network optimization problems |
scientific article; zbMATH DE number 5721984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the approximability of minmax (regret) network optimization problems |
scientific article; zbMATH DE number 5721984 |
Statements
On the approximability of minmax (regret) network optimization problems (English)
0 references
16 June 2010
0 references
combinatorial problems
0 references
approximation
0 references
minmax
0 references
minmax regret
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0.8648999929428101
0 references
0.8528857231140137
0 references
0.8398276567459106
0 references
0.8317273259162903
0 references
