The Community for Technology Leaders
Green Image
ABSTRACT
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.
INDEX TERMS
null
CITATION
F. Rubin, "Further Comments on "An Optimal Solution for the Channel- Assignment Problem"", IEEE Transactions on Computers, vol. 30, no. , pp. 455, June 1981, doi:10.1109/TC.1981.1675817
99 ms
(Ver )