A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116)

From MaRDI portal
Revision as of 03:49, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
scientific article

    Statements

    A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (English)
    0 references
    0 references
    0 references
    19 December 2013
    0 references
    tree augmentation
    0 references
    edge-connectivity
    0 references
    laminar family
    0 references
    local replacement
    0 references
    approximation algorithms
    0 references

    Identifiers