Introduction to VLSI Systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
The “PI” (placement and interconnect) system
DAC '82 Proceedings of the 19th Design Automation Conference
An Optimal Solution for the Channel-Assignment Problem
IEEE Transactions on Computers
A polynomial time algorithm for optimal routing around a rectangle
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
The problem of connecting a set of terminals that lie on the sides of a rectangle to minimize the total area is discussed. We present an O(nm) approximation algorithm to solve this problem where n is the number of terminals and m is the number of signal nets. Our algorithm generates a solution with an area 驴1.69* OPT where OPT is the area of an optimal solution. Our algorithm routes some of the nets by a simple greedy strategy. The remaining nets are routed using several strategies and four layouts are obtained. The best of these layouts is the solution generated by our algorithm.