Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs (Q2929700)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs |
scientific article |
Statements
Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs (English)
0 references
14 November 2014
0 references
approximation algorithms
0 references
graph connectivity
0 references
iterative rounding
0 references
linear programming
0 references
