A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Thek-Steiner Ratio in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation algorithms for the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On component-size bounded Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem in phylogeny is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the selected-internal Steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the terminal Steiner tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The full Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for terminal Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank

Latest revision as of 12:16, 2 July 2024

scientific article
Language Label Description Also known as
English
A better constant-factor approximation for selected-internal Steiner minimum tree
scientific article

    Statements

    A better constant-factor approximation for selected-internal Steiner minimum tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2010
    0 references
    0 references
    selected-internal Steiner tree
    0 references
    approximation algorithm
    0 references
    0 references