Approximating node connectivity problems via set covers (Q1424250)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating node connectivity problems via set covers |
scientific article |
Statements
Approximating node connectivity problems via set covers (English)
0 references
11 March 2004
0 references
\(k\)-vertex connected spanning subgraph
0 references
approximation algorithms
0 references
metric costs
0 references
