The following pages link to (Q4448761):
Displaying 9 items.
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792) (← links)
- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees (Q3595372) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- (Q4945797) (← links)
- (Q5480276) (← links)