A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing
1999
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
It is well known that a non-Manhattan channel router always uses fewer routing tracks than a Manhattan router in a channel. To our knowledge, for a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, Chaudhary's O(kn 2 ) heuristic algorithm [8] and Chen's O(k 2 n) optimal algorithm [9] have been, respectively, proposed, where n is the number of terminals and k is the number of routing tracks in a channel. However, the time complexity of the two algorithms is in O(n 3 ) time in
doi:10.1109/43.743726
fatcat:tvohybd6rrespkplym2ljloyze