Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding (Q2921713)
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: Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding |
scientific article; zbMATH DE number 6354870
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding |
scientific article; zbMATH DE number 6354870 |
Statements
13 October 2014
0 references
Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding (English)
0 references
