Title :
A 2.5 approximation algorithm for the multi-via assignment problem
Author :
Bui, Thang Nguyen ; Hsu, Willie ; Lee, Sing-Ling
Author_Institution :
Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA
fDate :
11/1/1992 12:00:00 AM
Abstract :
The via assignment problem, whose objective is to minimize the number of via columns used, is known to be NP-hard even when each net includes at most three vias. The authors develop efficient approximation algorithms for solving this problem. An algorithm for the case in which the size of each net is bounded by three is presented, and is then extended to the case in which the nets have arbitrary sizes
Keywords :
circuit layout CAD; computational complexity; printed circuit design; CAD; NP-hard; PCB layout; approximation algorithm; multilayer PC board; multivia assignment; via assignment problem; via columns minimisation; Approximation algorithms; Computer science; Integrated circuit interconnections; Integrated circuit technology; Nonhomogeneous media; Optimized production technology; Pins; Printed circuits; Routing; Wires;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
