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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127112599, #quickstatements; #temporary_batch_1722364966119
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Santosh Vempala / rank
Normal rank
 
Property / author
 
Property / author: Santosh Vempala / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/3341599 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2979731478 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127112599 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:58, 30 July 2024

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