The following pages link to (Q3210200):
Displaying 16 items.
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- Switchbox routing in VLSI design: Closing the complexity gap (Q1274317) (← links)
- The rectilinear class Steiner tree problem for intervals on two parallel lines (Q1327560) (← links)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph (Q1339122) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Packing Steiner trees: Polyhedral investigations (Q1919089) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- Construction of the current Steiner network of the second optimality rank (Q1996798) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- Packing Steiner trees with identical terminal sets (Q2390272) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
