Pages that link to "Item:Q3128200"
From MaRDI portal
The following pages link to Steiner Trees for Terminals Constrained to Curves (Q3128200):
Displaying 17 items.
- Directional derivative of the weight of a minimal filling in Riemannian manifolds (Q493881) (← links)
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- Expansion of linear Steiner trees (Q1386364) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Computing Euclidean Steiner trees over segments (Q2219516) (← links)
- On the history of the Euclidean Steiner tree problem (Q2249438) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- A polynomial algorithm for a constrained traveling salesman problem (Q2748381) (← links)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758) (← links)
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
- Angle-Restricted Steiner Arborescences for Flow Map Layout (Q3104619) (← links)
- Convexity and the Steiner tree problem (Q3789369) (← links)
- A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves (Q4242784) (← links)
- A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ (Q6080617) (← links)
- Fully dynamic algorithms for Euclidean Steiner tree (Q6575381) (← links)
