Pages that link to "Item:Q4206584"

The following pages link to Faster exact algorithms for steiner trees in planar networks (Q4206584):

Displaying 11 items.

• An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
• Approximating the selected-internal Steiner tree (Q995588) (← links)
• Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
• The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
• A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
• Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
• Tree polytope on 2-trees (Q1322553) (← links)
• The Steiner tree problem for terminals on the boundary of a rectilinear polygon (Q1566725) (← links)
• A dynamic programming approach for the pipe network layout problem (Q1735166) (← links)
• On the terminal Steiner tree problem. (Q1853109) (← links)
• A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets (Q6487979) (← links)