Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions (Q5171191)

From MaRDI portal
Revision as of 10:42, 12 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references