The following pages link to On the Problem of Steiner (Q3283373):
Displaying 50 items.
- Computing the optimal bridge between two convex polygons (Q294636) (← links)
- Maximising the worth of nascent networks (Q301061) (← links)
- The exchange value embedded in a transport system (Q607562) (← links)
- The Steiner problem on surfaces of revolution (Q742573) (← 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)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- The Steiner ratio conjecture is true for five points (Q1065011) (← links)
- A linear time algorithm for full Steiner trees (Q1068839) (← links)
- Exact computation of Steiner minimal trees in the plane (Q1076029) (← links)
- Hexagonal coordinate systems and Steiner minimal trees (Q1080858) (← links)
- Steiner minimal trees for regular polygons (Q1085166) (← links)
- Steiner minimal trees on sets of four points (Q1091392) (← links)
- The Steiner problem on a surface (Q1098407) (← links)
- A Steiner tree associated with three quarks (Q1099607) (← links)
- Analytic formulas for full Steiner trees (Q1174509) (← links)
- The Steiner ratio conjecture for six points (Q1177947) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- The Steiner ratio for five points (Q1179750) (← 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)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Graham's problem on shortest networks for points on a circle (Q1186796) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← 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)
- The Steiner minimal network for convex configurations (Q1207800) (← links)
- When facilities coincide: Exact optimality conditions in multifacility location (Q1209505) (← links)
- Some remarks on the Steiner problem (Q1251668) (← links)
- Minimal binary trees with a regular boundary: The case of skeletons with five endpoints (Q1274069) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- Symmetrization theorem of full Steiner trees (Q1328395) (← links)
- Some results on greedy algorithm conjectures (Q1331899) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- Full minimal Steiner trees on lattice sets (Q1356020) (← links)
- Cut and patch Steiner trees for ladders (Q1356409) (← links)
- Non-crossing of plane minimal spanning and minimal T1 networks (Q1377869) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- Minimal curvature-constrained networks (Q1756754) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- A short proof of a result of Pollak on Steiner minimal trees (Q1837195) (← links)
- A class of full Steiner minimal trees (Q1837695) (← links)
- Planar Manhattan local minimal and critical networks (Q1864609) (← links)
- Computing Steiner points for gradient-constrained minimum networks (Q1952503) (← links)
- On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
- Construction of the current Steiner network of the second optimality rank (Q1996798) (← links)
- Modeling of optimal networks by means of linkages (Q2055321) (← links)
- Bifurcations of binary types of Steiner minimal networks in the plane (Q2055330) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
