An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph (Q4429672)
From MaRDI portal
scientific article; zbMATH DE number 1986341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph |
scientific article; zbMATH DE number 1986341 |
Statements
An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph (English)
0 references
28 September 2003
0 references
approximation algorithm
0 references
\(\ell\)-critically \(k\)-connected graph
0 references
linear programming relaxation
0 references
network design
0 references
\(k\)-outconnected graph
0 references
vertex connectivity
0 references
