A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (Q4973051)

From MaRDI portal
Revision as of 19:58, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127112599, #quickstatements; #temporary_batch_1722364966119)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7138985
Language Label Description Also known as
English
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem
scientific article; zbMATH DE number 7138985

    Statements

    A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (English)
    0 references
    0 references
    0 references
    2 December 2019
    0 references
    approximation algorithms
    0 references
    graph connectivity
    0 references

    Identifiers

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