An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph (Q4429672)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1986341
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.926076352596283
0 references
0.8940956592559814
0 references
0.8919562697410583
0 references
0.8857954740524292
0 references
