The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772)

From MaRDI portal
Revision as of 23:33, 22 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
The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
scientific article

    Statements

    The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2020
    0 references
    2-edge connected graph
    0 references
    2-edge covers
    0 references
    approximation algorithms
    0 references
    bridges
    0 references
    connectivity augmentation
    0 references
    forest augmentation problem
    0 references
    matching augmentation problem
    0 references
    network design
    0 references

    Identifiers

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