On the approximability of minmax (regret) network optimization problems (Q976089): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006806110 / rank | |||
Revision as of 01:59, 20 March 2024
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
