Approximating minimum-cost connectivity problems via uncrossable bifamilies (Q2933629)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating minimum-cost connectivity problems via uncrossable bifamilies |
scientific article |
Statements
Approximating minimum-cost connectivity problems via uncrossable bifamilies (English)
0 references
5 December 2014
0 references
approximation algorithms
0 references
graph connectivity
0 references
node-costs
0 references
rooted connectivity
0 references
