Title :
Constrained via minimization
Author :
Ahn, Keumog ; Sahni, Sartaj
Author_Institution :
Minnesota Univ., Minneapolis, MN, USA
fDate :
2/1/1993 12:00:00 AM
Abstract :
It is shown that the general two-layer constrained via minimization problem and the three-layer constrained via minimization problem for HVH topologies are NP-hard. A backtracking algorithm and a heuristic algorithm for the three-layer HVH constrained via minimization problem are proposed. The backtracking algorithm can also be used for three-layer non-HVH problems. Experimental results indicate that the heuristic generally outperforms that of K. Chang et al. (unpublished)
Keywords :
circuit layout CAD; computational complexity; minimisation; network topology; CAD; HVH topologies; NP-hard; backtracking algorithm; heuristic algorithm; three layer problem; two layer problem; via minimization; Contacts; Helium; Heuristic algorithms; Minimization methods; Routing; Topology; Wire;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
