Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
From MaRDI portal
Publication:2064280
DOI10.1016/J.DAM.2019.03.015zbMATH Open1483.90134OpenAlexW2935104118WikidataQ114191517 ScholiaQ114191517MaRDI QIDQ2064280FDOQ2064280
Authors: Marcia Fampa 
Publication date: 5 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.03.015
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
- The Steiner tree problem
- Steiner Minimal Trees
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- On the Problem of Steiner
- Title not available (Why is that?)
- The Complexity of Computing Steiner Minimal Trees
- Title not available (Why is that?)
- Orbital branching
- How to find Steiner minimal trees in Euclidean \(d\)-space
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
- Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
- Euclidean Steiner minimum trees: An improved exact algorithm
- On the low-dimensional Steiner minimum tree problem in Hamming metric
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- Pruning by isomorphism in branch-and-cut
- Exploiting orbits in symmetric ILP
- Steiner Trees for Terminals Constrained to Curves
- Using a conic formulation for finding Steiner minimal trees
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
- A linear time algorithm for full Steiner trees
- Rectilinear group Steiner trees and applications in VLSI design
- Title not available (Why is that?)
- On the Steiner Problem
- An algorithm for the steiner problem in the euclidean plane
- Virtuous smoothing for global optimization
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
- Title not available (Why is that?)
- Steiner trees and 3-D macromolecular conformation
Cited In (10)
- Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\)
- The 1-Steiner-Minimal-Tree problem in Minkowski-spaces
- Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
- 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
- Generalised \(k\)-Steiner tree problems in normed planes
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
- Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
- Exact computation of Steiner minimal trees in the plane
- The structure of minimal Steiner trees in the neighborhoods of the lunes of their edges
Uses Software
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)
