Pages that link to "Item:Q4120589"

The following pages link to Rectilinear steiner trees: Efficient special-case algorithms (Q4120589):

Displaying 18 items.

• Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
• Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
• The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
• How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
• A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
• Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← 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. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
• The Steiner tree problem in orientation metrics (Q1384537) (← links)
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
• Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology (Q1709982) (← links)
• Steiner's problem in double trees (Q1861809) (← links)
• (Q3907583) (← links)
• Rectilinear Steiner Trees in Rectangle Trees (Q3964590) (← links)
• A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
• The computation of nearly minimal Steiner trees in graphs (Q4750659) (← links)
• A rectilinear steiner minimal tree algorithm for convex point sets (Q5056104) (← links)