Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Zeev Nutov / rank | |||
| Property / author | |||
| Property / author: Zeev Nutov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1203.3578 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:23, 19 April 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
