Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4537732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal edge-coverings of pairs of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal–dual schema based approximation algorithm for the element connectivity problem / 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: Hardness of Approximation for Vertex-Connectivity Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating node connectivity problems via set covers / 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: Q4829040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and linking systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the survivable network design problem in hypergraphs / rank
 
Normal rank

Latest revision as of 18:04, 24 June 2024

scientific article
Language Label Description Also known as
English
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
scientific article

    Statements

    Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (English)
    0 references
    0 references
    12 July 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    network design
    0 references
    0 references