A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q294661
Property / author
 
Property / author: Joseph Cheriyan / rank
Normal rank
 

Revision as of 11:52, 12 February 2024

scientific article; zbMATH DE number 7572599
Language Label Description Also known as
English
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
scientific article; zbMATH DE number 7572599

    Statements

    A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 August 2022
    0 references
    2-edge connectivity
    0 references
    approximation algorithms
    0 references
    subtour linear program for traveling salesman problem
    0 references

    Identifiers

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