Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal vertex-connectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Uniform Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Graph Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for minimum-cost vertex-connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank

Latest revision as of 16:30, 28 May 2024

scientific article
Language Label Description Also known as
English
Faster approximation algorithms for weighted triconnectivity augmentation problems
scientific article

    Statements

    Faster approximation algorithms for weighted triconnectivity augmentation problems (English)
    0 references
    0 references
    0 references
    23 March 1999
    0 references
    0 references
    graph
    0 references
    vertex connectivity
    0 references
    augmentation problem
    0 references
    minimum-weight augmenting edge-set
    0 references
    3-approximation algorithm
    0 references