Pages that link to "Item:Q1186799"

The following pages link to A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799):

Displaying 8 items.

• The Steiner tree problem in orientation metrics (Q1384537) (← links)
• The Steiner tree problem for terminals on the boundary of a rectilinear polygon (Q1566725) (← links)
• Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
• Steiner's problem in double trees (Q1861809) (← links)
• Planar Manhattan local minimal and critical networks (Q1864609) (← links)
• A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves (Q4242784) (← links)
• A rectilinear steiner minimal tree algorithm for convex point sets (Q5056104) (← links)
• A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets (Q6487979) (← links)