Pages that link to "Item:Q826086"

The following pages link to Solving rectilinear Steiner tree problems exactly in theory and practice (Q826086):

Displaying 19 items.

• Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
• The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
• Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
• Faster approximation algorithms for the rectilinear Steiner tree problem (Q1361816) (← links)
• The Steiner tree problem for terminals on the boundary of a rectilinear polygon (Q1566725) (← links)
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
• On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (Q1969944) (← links)
• Two-level rectilinear Steiner trees (Q2362106) (← links)
• The number of tree stars is \(O^{*}(1.357^k)\) (Q2461549) (← links)
• Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems (Q3132873) (← links)
• The number of tree stars is O*(1.357k) (Q3439499) (← links)
• Rectilinear full Steiner tree generation (Q4242783) (← links)
• A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
• Reductions for the rectilinear steiner tree problem (Q4894857) (← links)
• (Q4952700) (← links)
• Logic Programming (Q5313200) (← links)