Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs (Q2870515)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs |
scientific article |
Statements
Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs (English)
0 references
21 January 2014
0 references
graph connectivity
0 references
network design
0 references
\(k\)-vertex connected spanning subgraphs
0 references
rooted connectivity
0 references
directed Steiner tree
0 references
