Pages that link to "Item:Q1076029"

The following pages link to Exact computation of Steiner minimal trees in the plane (Q1076029):

Displaying 24 items.

• Steiner minimal trees for bar waves (Q580349) (← links)
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
• A linear time algorithm for full Steiner trees (Q1068839) (← links)
• Steiner minimal trees for regular polygons (Q1085166) (← links)
• A decomposition theorem on Euclidean Steiner minimal trees (Q1112056) (← links)
• Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
• A primer of the Euclidean Steiner problem (Q1179729) (← links)
• Steiner minimal trees for three points with one convex polygonal obstacle (Q1179763) (← links)
• How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
• Improved computation of plane Steiner minimal trees (Q1186797) (← links)
• Steiner minimal trees for a class of zigzag lines (Q1186798) (← links)
• A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
• A neural network for the Steiner minimal tree problem (Q1323577) (← links)
• Full minimal Steiner trees on lattice sets (Q1356020) (← links)
• Optimal Steiner hull algorithm (Q1862120) (← links)
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
• An example of an infinite Steiner tree connecting an uncountable set (Q2353496) (← links)
• Geometry-experiment algorithm for Steiner minimal tree problem (Q2375521) (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
• Steiner minimal trees in rectilinear and octilinear planes (Q2463797) (← links)
• Solution of the Steiner problem for convex boundaries (Q3203048) (← links)
• An algorithm for the steiner problem in the euclidean plane (Q3713880) (← links)
• (Q3970808) (← links)
• Euclidean Steiner minimum trees: An improved exact algorithm (Q4363408) (← links)