The following pages link to (Q3210200):
Displaying 5 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)
- On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
