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
A Simple Approximation Algorithm for Two Problems in Circuit Design
IEEE Transactions on Computers
Minimum-Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Computers
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
Information Processing Letters
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle
IEEE Transactions on Parallel and Distributed Systems
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.01 |
The problem of connecting a set of terminals that lie on the sides of a rectangle to minimize the total area is discussed. An O(n) algorithm is presented to solve this problem when the set of n terminals is initially sorted. The strategy in this paper is to reduce the problem to several problems such that no matter what instance is started with, at least one of these problems can be solved optimally by a greedy method.