Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs (Q2870515)
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: Approximation algorithms for minimum-cost k-(S,T) connected digraphs |
scientific article; zbMATH DE number 6248048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs |
scientific article; zbMATH DE number 6248048 |
Statements
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
Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs (English)
0 references
0.8565571904182434
0 references
0.8349061012268066
0 references
0.8328858613967896
0 references
