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 the normal view instead:
scientific article; zbMATH DE number 6354870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9872660040855408
0 references
0.8876716494560242
0 references
0.8780750036239624
0 references
0.8720260262489319
0 references
