Pages that link to "Item:Q1361816"

The following pages link to Faster approximation algorithms for the rectilinear Steiner tree problem (Q1361816):

Displaying 9 items.

• A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (Q1178221) (← links)
• Polynomial time approximation scheme for the rectilinear Steiner arborescence problem (Q1587590) (← links)
• A practical algorithm for the minimum rectilinear Steiner tree (Q1966510) (← links)
• Two-level rectilinear Steiner trees (Q2362106) (← links)
• The number of tree stars is \(O^{*}(1.357^k)\) (Q2461549) (← links)
• Bounding the expected number of rectilinear full Steiner trees (Q3057162) (← links)
• (Q4038157) (← links)
• Improved Approximations for the Steiner Tree Problem (Q4314498) (← links)
• Reductions for the rectilinear steiner tree problem (Q4894857) (← links)