The following pages link to SteinLib (Q16253):
Displaying 14 items.
- (Q5170933) (← links)
- A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- How Many Steiner Terminals Can You Connect in 20 Years? (Q5265171) (← links)
- Computational Integer Programming and Cutting Planes (Q5292084) (← links)
- (Q5301743) (← links)
- New Reduction Techniques for the Group Steiner Tree Problem (Q5426902) (← links)
- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks (Q5432316) (← links)
- (Q5874465) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)
- Improved algorithms for the Steiner problem in networks (Q5946826) (← links)