Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding |
scientific article |
Statements
Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (English)
0 references
24 November 2010
0 references
approximation algorithms
0 references
network design
0 references
graph connectivity
0 references
edge connectivity
0 references
linear program
0 references
LP-rounding
0 references
MAX SNP-hardness
0 references
