Pages that link to "Item:Q5665121"
From MaRDI portal
The following pages link to The Generation of Minimal Trees with a Steiner Topology (Q5665121):
Displaying 11 items.
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- Minimal length tree networks on the unit sphere (Q1179757) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- A model for determining the cost-effectiveness of T1 transmission in certain integrated networks (Q1206164) (← links)
- A neural network for the Steiner minimal tree problem (Q1323577) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- Geometry-experiment algorithm for Steiner minimal tree problem (Q2375521) (← links)
- Approximations and lower bounds for the length of minimal Euclidean Steiner trees (Q2457920) (← links)
- Cost-minimal trees in directed acyclic graphs (Q5181099) (← links)
