An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem (Q4907576)
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: An O(^2k)-approximation algorithm for the k-vertex connected spanning subgraph problem |
scientific article; zbMATH DE number 6134254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem |
scientific article; zbMATH DE number 6134254 |
Statements
An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem (English)
0 references
4 February 2013
0 references
approximation algorithm
0 references
connected spanning subgraph problem
0 references
Frank-Tardos algorithm
0 references
\(k\)-outconnected subgraph
0 references
0.926076352596283
0 references
0.8799142241477966
0 references
0.8790698051452637
0 references
0.8669219017028809
0 references
0.8668085336685181
0 references
