The following pages link to The 1-steiner tree problem (Q3783604):
Displaying 18 items.
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- Survivable minimum bottleneck networks (Q904084) (← links)
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs (Q916391) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Local optimization of neuron arbors (Q1192042) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- The Steiner tree problem (Q1202044) (← links)
- On the number of minimal 1-Steiner trees (Q1330879) (← links)
- A constrained minimum spanning tree problem (Q1571033) (← links)
- Low-degree minimum spanning trees (Q1895968) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Generalised \(k\)-Steiner tree problems in normed planes (Q2258073) (← links)
- The 1-Steiner-Minimal-Tree problem in Minkowski-spaces (Q3978585) (← links)
- An exact algorithm for the Euclidean \(k\)-Steiner tree problem (Q6577436) (← links)
- An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem (Q6606207) (← links)
