Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph (Q2884575)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph |
scientific article |
Statements
Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph (English)
0 references
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
