Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs (Q2929700)
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 6369509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs |
scientific article; zbMATH DE number 6369509 |
Statements
14 November 2014
0 references
approximation algorithms
0 references
graph connectivity
0 references
iterative rounding
0 references
linear programming
0 references
Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs (English)
0 references
0.8940956592559814
0 references
0.8843070268630981
0 references
0.8751441240310669
0 references
