The Euclidean bottleneck full Steiner tree problem (Q2258077): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact solutions to the Euclidean bottleneck Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek-Steiner Ratio in Graphs / 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: Approximations for Steiner trees with minimum number of Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Full and Bottleneck Full Steiner Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for drawing a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / 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: Advances in Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial sum criterion for Steiner trees in graphs and shortest paths / 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: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / 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: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck Steiner trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for a bottleneck Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane / rank
 
Normal rank

Latest revision as of 19:12, 9 July 2024

scientific article
Language Label Description Also known as
English
The Euclidean bottleneck full Steiner tree problem
scientific article

    Statements

    The Euclidean bottleneck full Steiner tree problem (English)
    0 references
    0 references
    2 March 2015
    0 references
    geometric optimization
    0 references
    Steiner trees
    0 references
    bottleneck full Steiner tree problem
    0 references
    NP-hard
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references