Abstract:
In the above paper1Gupta, 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 runn...Show MoreMetadata
Abstract:
In the above paper1Gupta, 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.
Published in: IEEE Transactions on Computers ( Volume: C-30, Issue: 6, June 1981)
