Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree (Q4977990)
From MaRDI portal
!
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 6761826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree |
scientific article; zbMATH DE number 6761826 |
Statements
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree (English)
0 references
17 August 2017
0 references
directed Steiner tree
0 references
approximation algorithms
0 references
group Steiner tree
0 references
survivable network design
0 references
0.8055415749549866
0 references
0.7997556328773499
0 references
0.7979606986045837
0 references
0.797814130783081
0 references
