On the cycle augmentation problem: hardness and approximation algorithms (Q2230719)

From MaRDI portal
Revision as of 16:54, 26 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the cycle augmentation problem: hardness and approximation algorithms
scientific article

    Statements

    On the cycle augmentation problem: hardness and approximation algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 September 2021
    0 references
    approximation algorithms
    0 references
    connectivity augmentation
    0 references
    cactus augmentation
    0 references
    cycle augmentation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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