Distribution of the Minimum Channel Width in VLSI Wiring
Don Coppersmith, Indhumathi Gopal, C. K. Wong · SIAM Journal on Algebraic and Discrete Methods · 1987
Suppose we have N terminals on one side of a wiring channel, and N on the other side, and we wish to achieve a given interconnection specified by a randomly chosen permutation function. We show that the minimum number of horizontal channels necessary is close to $N / 2$ most of the time.