An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:25, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem |
scientific article |
Statements
An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (English)
0 references
2 September 2015
0 references
algorithms
0 references
approximation algorithms
0 references
graph connectivity
0 references
network design
0 references
subset \(k\)-connected subgraph
0 references
