A greedy approximation algorithm for the group Steiner problem (Q2581556): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating min-sum <i>k</i> -clustering in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the covering Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the weight of shallow Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of approximation algorithms for the acyclic directed Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828915 / rank
 
Normal rank

Latest revision as of 14:56, 11 June 2024

scientific article
Language Label Description Also known as
English
A greedy approximation algorithm for the group Steiner problem
scientific article

    Statements

    A greedy approximation algorithm for the group Steiner problem (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    polylogarithmic ratio approximation
    0 references
    0 references