Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
From MaRDI portal
Publication:2064280
Recommendations
- An improved algorithm for computing Steiner minimal trees in Euclidean d-space
- scientific article; zbMATH DE number 3912403
- Exact computation of Steiner minimal trees in the plane
- scientific article; zbMATH DE number 1302185
- Approximations and lower bounds for the length of minimal Euclidean Steiner trees
- scientific article; zbMATH DE number 1339503
- scientific article; zbMATH DE number 1302181
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Euclidean Steiner minimum trees: An improved exact algorithm
Cites work
- A linear time algorithm for full Steiner trees
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
- An algorithm for the steiner problem in the euclidean plane
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- An improved algorithm for computing Steiner minimal trees in Euclidean d-space
- An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
- Euclidean Steiner minimum trees: An improved exact algorithm
- Exploiting orbits in symmetric ILP
- Geometric conditions for Euclidean Steiner trees in R^d
- How to find Steiner minimal trees in Euclidean \(d\)-space
- scientific article; zbMATH DE number 4191148 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 1305548 (Why is no real title available?)
- scientific article; zbMATH DE number 1424547 (Why is no real title available?)
- On the low-dimensional Steiner minimum tree problem in Hamming metric
- On the Problem of Steiner
- On the Steiner Problem
- Orbital branching
- Pruning by isomorphism in branch-and-cut
- Rectilinear group Steiner trees and applications in VLSI design
- Steiner Minimal Trees
- Steiner trees and 3-D macromolecular conformation
- Steiner Trees for Terminals Constrained to Curves
- The Complexity of Computing Steiner Minimal Trees
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
- The Steiner tree problem
- Using a conic formulation for finding Steiner minimal trees
- Virtuous smoothing for global optimization
Cited in
(12)- Exact computation of Steiner minimal trees in the plane
- Geometric conditions for Euclidean Steiner trees in R^d
- Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
- Generalised \(k\)-Steiner tree problems in normed planes
- The structure of minimal Steiner trees in the neighborhoods of the lunes of their edges
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
- The 1-Steiner-Minimal-Tree problem in Minkowski-spaces
- Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E^ 3
- A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Mathematical optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
- Length-minimizing LED trees
This page was built for publication: Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064280)
