Steiner Trees for Terminals Constrained to Curves
From MaRDI portal
Publication:3128200
Recommendations
- scientific article; zbMATH DE number 1286271
- Steiner trees on curved surfaces
- Steiner trees and convex geometries
- Constrained Steiner trees in Halin graphs
- scientific article; zbMATH DE number 1163707
- The Steiner tree problem for terminals on the boundary of a rectilinear polygon
- Computing and Combinatorics
- Algorithms for terminal Steiner trees
- A note on the terminal Steiner tree problem
- Diameter-constrained Steiner trees
Cited in
(17)- Convexity and the Steiner tree problem
- scientific article; zbMATH DE number 1286271 (Why is no real title available?)
- Directional derivative of the weight of a minimal filling in Riemannian manifolds
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
- On the restricted \(k\)-Steiner tree problem
- scientific article; zbMATH DE number 1424546 (Why is no real title available?)
- Fully dynamic algorithms for Euclidean Steiner tree
- Computing Euclidean Steiner trees over segments
- Angle-Restricted Steiner Arborescences for Flow Map Layout
- Approximate Euclidean Steiner trees
- A polynomial algorithm for a constrained traveling salesman problem
- On the restricted 1-Steiner tree problem
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD
- A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
- On the history of the Euclidean Steiner tree problem
This page was built for publication: Steiner Trees for Terminals Constrained to Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128200)