On the approximability of minmax (regret) network optimization problems (Q976089)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the approximability of minmax (regret) network optimization problems |
scientific article |
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
