On the approximability of robust spanning tree problems (Q620950)
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 robust spanning tree problems |
scientific article; zbMATH DE number 5843646
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the approximability of robust spanning tree problems |
scientific article; zbMATH DE number 5843646 |
Statements
On the approximability of robust spanning tree problems (English)
0 references
2 February 2011
0 references
combinatorial optimization
0 references
approximation
0 references
robust optimization
0 references
two-stage optimization
0 references
computational complexity
0 references
0 references
0 references
0 references
0.94095075
0 references
0.9175472
0 references
0.9175472
0 references
0.9131901
0 references
0.90983135
0 references
0.90829754
0 references
0.9082823
0 references
0.9000178
0 references
