Next: MINIMUM TRAVELING REPAIRMAN
Up: Routing Problems
Previous: SHORTEST WEIGHT-CONSTRAINED PATH
-array of gates, collection C of nets, i.e., 3-sets of gates.
Wires following rectilinear paths connecting the gates in each net.
The largest number of wires in the same channel between two gates in the
- Good News:
In APX if
The approximation algorithm will work also for nets with more than three gates,
but the running time is exponential in the number of terminals.