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):

Displayed 5 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)
• Steiner's problem in double trees (Q1861809) ‎ (← links)
• Planar Manhattan local minimal and critical networks (Q1864609) ‎ (← links)
• (Q4242784) ‎ (← links)