Approximate Euclidean Steiner trees (Q2397467): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Charl J. Ras / rank
 
Normal rank
Property / author
 
Property / author: Konrad J. Swanepoel / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GeoSteiner / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099580205 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.01172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner minimal trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interconnection trees in the plane. Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric methods and optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the history of the Euclidean Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for full Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / 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 GeoSteiner software package for computing Steiner trees in the plane: an updated computational study / rank
 
Normal rank
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: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dealing with large hidden constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find Steiner minimal trees in Euclidean \(d\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for the lengths of Steiner trees in 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum networks for four points in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations and lower bounds for the length of minimal Euclidean Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel approach to phylogenetic trees: <i>d</i>‐Dimensional geometric Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An example of an infinite Steiner tree connecting an uncountable set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex Numbers from A to ... Z / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic formulas for full Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum Steiner point trees in Minkowski planes / rank
 
Normal rank

Latest revision as of 21:21, 13 July 2024

scientific article
Language Label Description Also known as
English
Approximate Euclidean Steiner trees
scientific article

    Statements

    Approximate Euclidean Steiner trees (English)
    0 references
    0 references
    0 references
    0 references
    22 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate Steiner tree
    0 references
    Euclidean Steiner problem
    0 references
    shortest networks
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references