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(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem |
scientific article; zbMATH DE number 6134254
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
