Approximating minimum-cost connectivity problems via uncrossable bifamilies (Q2933629)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6377141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum-cost connectivity problems via uncrossable bifamilies |
scientific article; zbMATH DE number 6377141 |
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
0.8758294582366943
0 references
0.8725008964538574
0 references
0.8608176708221436
0 references
0.8489500284194946
0 references
