Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319): 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.1016/j.jcss.2005.05.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968690018 / rank | |||
Normal rank | |||
Revision as of 22:36, 19 March 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
