Pages that link to "Item:Q1186793"

The following pages link to How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793):

Displayed 11 items.

• A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) ‎ (← links)
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) ‎ (← links)
• On the Steiner ratio in 3-space (Q1345879) ‎ (← links)
• The Steiner tree problem in orientation metrics (Q1384537) ‎ (← links)
• Local search for the Steiner tree problem in the Euclidean plane (Q1806730) ‎ (← links)
• Approximations and lower bounds for the length of minimal Euclidean Steiner trees (Q2457920) ‎ (← links)
• (Q4506062) ‎ (← links)
• A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ (Q4546061) ‎ (← links)
• A novel approach to phylogenetic trees: <i>d</i>‐Dimensional geometric Steiner trees (Q5191133) ‎ (← links)
• Network modelling of underground mine layout: two case studies (Q5438555) ‎ (← links)
• Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) (Q5961625) ‎ (← links)