Inapproximability of survivable networks (Q1019191)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5558994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability of survivable networks |
scientific article; zbMATH DE number 5558994 |
Statements
Inapproximability of survivable networks (English)
0 references
28 May 2009
0 references
survivable network design problem
0 references
hardness of approximation
0 references
directed Steiner tree
0 references
\(k\)-connected subgraph
0 references
0.999999463558197
0 references
0.90062415599823
0 references
0.8942299485206604
0 references
0.8816882967948914
0 references
