An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved Approximations for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster exact algorithms for steiner trees in planar networks / 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: An improved LP-based approximation for steiner tree / 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: The Complexity of Computing Steiner Minimal Trees / 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: Q4252319 / 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 internal Steiner tree problem: Hardness and approximations / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better constant-factor approximation for selected-internal Steiner minimum tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The full Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / 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
Property / cites work
 
Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank
 
Normal rank

Latest revision as of 02:54, 11 July 2024

scientific article
Language Label Description Also known as
English
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
scientific article

    Statements

    An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2015
    0 references
    approximation algorithms
    0 references
    partial-terminal Steiner trees
    0 references
    Steiner tree problem
    0 references

    Identifiers