Issue No. 06 - June (1981 vol. 30)
F. Rubin , IBM
In the above paper<sup>1</sup>Gupta, Lee, and Leung present a new algorithm for making an optimal assignment of wire segments to channels on a PC board. The new algorithm has a running time of 0(N log N) in the general case, but can be executed in 0(N) time if the wire segment endpoints are close to uniformly distributed.
F. Rubin, "Further Comments on "An Optimal Solution for the Channel- Assignment Problem"," in IEEE Transactions on Computers, vol. 30, no. , pp. 455, 1981.