Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph (Q2884575)
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: Iterated rounding algorithms for the smallest k-edge connected spanning subgraph |
scientific article; zbMATH DE number 6039266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph |
scientific article; zbMATH DE number 6039266 |
Statements
30 May 2012
0 references
approximation algorithms
0 references
network design
0 references
linear programming
0 references
graph algorithms
0 references
graph connectivity
0 references
edge connectivity
0 references
Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph (English)
0 references
0.9006671905517578
0 references
0.8876716494560242
0 references
0.887006938457489
0 references
0.8825505375862122
0 references
