Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph (Q2884575): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/080732572 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083162966 / rank | |||
Normal rank | |||
Latest revision as of 20:56, 19 March 2024
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
