Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:15, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems |
scientific article |
Statements
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (English)
0 references
12 July 2006
0 references
approximation algorithm
0 references
network design
0 references