The following pages link to (Q4763418):
Displaying 8 items.
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- A simple proof of the planar rectilinear Steiner ratio (Q1200801) (← links)
- A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- A faster approximation algorithm for the Steiner tree problem in graphs (Q1802062) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)
