Pages that link to "Item:Q1969944"

The following pages link to On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (Q1969944):

Displaying 19 items.

• Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
• Solving rectilinear Steiner tree problems exactly in theory and practice (Q826086) (← links)
• Comments on Bern's probabilistic results on rectilinear Steiner trees (Q911764) (← links)
• Two probabilistic results on rectilinear Steiner trees (Q1105495) (← 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 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)
• Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology (Q1709982) (← links)
• Exact solutions for the Steiner path cover problem on special graph classes (Q2050271) (← links)
• The number of tree stars is \(O^{*}(1.357^k)\) (Q2461549) (← links)
• Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792) (← links)
• Bounding the expected number of rectilinear full Steiner trees (Q3057162) (← links)
• Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems (Q3132873) (← links)
• The number of tree stars is O*(1.357k) (Q3439499) (← links)
• Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle (Q3487159) (← links)
• A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves (Q4242784) (← links)
• A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
• (Q4952700) (← links)