swMATH10825MaRDI QIDQ22779FDOQ22779
Author name not available (Why is that?)
Official website: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=3208
Cited In (10)
- A branch-and-price algorithm for switch-box routing
- Steiner tree packing revisited
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
- The cavity approach for Steiner trees packing problems
- How Many Steiner Terminals Can You Connect in 20 Years?
- Single bend wiring on surfaces
- The Steiner tree packing problem in VLSI design
- Optimal algorithms for adjacent side routing
- A branch-and-price algorithm for the Steiner tree packing problem.
- Packing Steiner trees: A cutting plane algorithm and computational results
This page was built for software: BEAVER
