Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions (Q5171191): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:45, 8 February 2024
scientific article; zbMATH DE number 6321489
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions |
scientific article; zbMATH DE number 6321489 |
Statements
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions (English)
0 references
25 July 2014
0 references