Wiring the (2-by-n) Grid
Computation of trees recursively:
- Construct
- For simply compute extensions from each of the and pick the cheapest one.
Claim routes a net in O(n log(m)) time, for n columns and m tracks.
Add vertical tracks to ends of channel as needed to meet capacity constraints
Cannot handle cycles in VCG (what happens?)