Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:17, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design |
scientific article |
Statements
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (English)
0 references
8 October 2015
0 references
iterative rounding
0 references
node connectivity
0 references
network design
0 references
approximation algorithm
0 references
