Nov 19, 1992 · An efficient one-side height minimization algorithm for routing around a rectangle☆ · Keywords · References · Cited by (0) · Recommended articles.
The one-side height minimization problem for two-layer rectilinear wiring around a rectangular module is studied. We given an O(mloglogm) time algorithm, ...
An efficient one-side height minimization algorithm for routing around a rectangle. Authors: Author Picture Kim-Heng Teo.
Nov 19, 1992 · Fig. 2. (a) A "Z" shape layout for wiring around modules A and B. (b) Compacted layout after reducing the right side height on A.
Bibliographic details on An Efficient One-Side Height Minimization Algorithm for Routing Around a Rectangle.
ANALYSIS OF ALGORITHMS; DATA STRUCTURES; DESIGN OF ALGORITHMS; DETAILED ROUTING AROUND A RECTANGLE; OPTIMIZATION; PRIORITY QUEUE; GRID-BASED WIRING; VLSI;.
The problem of connecting a set of n terminals belonging to m (signal) nets that lie on the sides of a rectangle to minimize the total area is discussed.
Simple efficient algorithms are given for three routing problems around a rectangle. The algorithms find routing in two or three layers for two-terminal ...
Missing: Minimization | Show results with:Minimization
An efficient one-side height minimization algorithm for routing around a rectangle ... The worst case analysis of algorithm on multiple stacks manipulation.
