The following pages link to Steiner Minimal Trees (Q5542568):
Displayed 50 items.
- Steiner minimal trees for bar waves (Q580349) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- Lower bounds for rectilinear Steiner trees in bounded space (Q750175) (← links)
- Numerical minimization of geometrical type problems related to calculus of variations (Q809346) (← links)
- A variational approach to the Steiner network problem (Q810521) (← links)
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
- An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach (Q853553) (← links)
- Steiner ratio for hyperbolic surfaces. (Q863754) (← links)
- Canonical decompositions of piecewise affine mappings, polyhedra-traces, and geometrical variational problems (Q950811) (← links)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- Comparison of distances between measures (Q1001104) (← links)
- The Steiner ratio conjecture is true for five points (Q1065011) (← links)
- A linear time algorithm for full Steiner trees (Q1068839) (← links)
- Hexagonal coordinate systems and Steiner minimal trees (Q1080858) (← links)
- Steiner minimal trees on sets of four points (Q1091392) (← links)
- A Steiner tree associated with three quarks (Q1099607) (← links)
- An algorithm for determining an opaque minimal forest of a convex polygon (Q1107998) (← links)
- A decomposition theorem on Euclidean Steiner minimal trees (Q1112056) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- Cost of sequential connection for points in space (Q1122502) (← links)
- The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
- A fast algorithm for Steiner trees (Q1145507) (← links)
- The Steiner problem in phylogeny is NP-complete (Q1167073) (← links)
- Analytic formulas for full Steiner trees (Q1174509) (← links)
- The Steiner ratio conjecture for six points (Q1177947) (← links)
- Some upper bounds for minimal trees (Q1178229) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- The Steiner ratio for five points (Q1179750) (← links)
- On Steiner ratio conjectures (Q1179751) (← links)
- Minimal length tree networks on the unit sphere (Q1179757) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- Steiner minimal trees for three points with one convex polygonal obstacle (Q1179763) (← links)
- The Steiner ratio conjecture for cocircular points (Q1186084) (← links)
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio (Q1186792) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- On Steiner minimal trees with \(L_ p\) distance (Q1186795) (← links)
- Graham's problem on shortest networks for points on a circle (Q1186796) (← links)
- Steiner minimal trees for a class of zigzag lines (Q1186798) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Supportability of network cost functions (Q1197768) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- Some remarks on the Steiner problem (Q1251668) (← links)
- Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- A neural network for the Steiner minimal tree problem (Q1323577) (← links)
- Symmetrization theorem of full Steiner trees (Q1328395) (← links)
- Some results on greedy algorithm conjectures (Q1331899) (← links)