Approximate Euclidean Steiner trees
From MaRDI portal
Publication:2397467
DOI10.1007/s10957-016-1036-5zbMath1362.90354arXiv1605.01172OpenAlexW3099580205WikidataQ59521383 ScholiaQ59521383MaRDI QIDQ2397467
Doreen Anne Thomas, Konrad J. Swanepoel, Charl J. Ras
Publication date: 22 May 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.01172
Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for full Steiner trees
- Analytic formulas for full Steiner trees
- How to find Steiner minimal trees in Euclidean \(d\)-space
- The Steiner tree problem
- Geometric methods and optimization problems
- Steiner minimal trees
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- Minimum networks for four points in space
- Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
- On the history of the Euclidean Steiner tree problem
- Optimal interconnection trees in the plane. Theory, algorithms and applications
- An example of an infinite Steiner tree connecting an uncountable set
- Upper and lower bounds for the lengths of Steiner trees in 3-space
- Approximations and lower bounds for the length of minimal Euclidean Steiner trees
- Complex Numbers from A to ... Z
- Approximating minimum Steiner point trees in Minkowski planes
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- On the Problem of Steiner
- The Complexity of Computing Steiner Minimal Trees
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- Dealing with large hidden constants
- Steiner Minimal Trees
- Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\)
This page was built for publication: Approximate Euclidean Steiner trees