Pages that link to "Item:Q3487159"
From MaRDI portal
The following pages link to Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle (Q3487159):
Displayed 8 items.
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- A simple proof of Hwang's theorem for rectilinear Steiner minimal trees (Q1179761) (← links)
- A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
- The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725) (← links)
- The rectilinear class Steiner tree problem for intervals on two parallel lines (Q1327560) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- The Steiner tree problem for terminals on the boundary of a rectilinear polygon (Q1566725) (← links)
- A rectilinear steiner minimal tree algorithm for convex point sets (Q5056104) (← links)