An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved approximation algorithm for the minimum cost subset k-connected subgraph problem |
scientific article; zbMATH DE number 6477671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem |
scientific article; zbMATH DE number 6477671 |
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
0 references
0 references
0 references
0 references
0.9875636696815492
0 references
0.8825512528419495
0 references
0.8482376933097839
0 references
0.8260284662246704
0 references
