Title :
An Approximation Problem for the Multi-Via Assignment Problem
Author :
Gonzalez, Teofilo F.
Author_Institution :
Department of Computer Science, The University of California, Santa Barbara, CA, USA
fDate :
10/1/1984 12:00:00 AM
Abstract :
We consider the multi-via assignment problem for multilayered printed circuit board routing. An efficient approximation algorithm for this problem is presented. The algorithm is of (low) polynomial time complexity and guarantees solutions with no more than 3 * OPT via columns, where OPT is the number of via columns in an optimal solution. Several issues relating to the computational complexity of via and multi-via assignment problems are also discussed.
Keywords :
Computer science; Integrated circuit interconnections; NP-hard problem; Nonhomogeneous media; Optimized production technology; Pins; Printed circuits; Routing; Silicon; Wires;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
DOI :
10.1109/TCAD.1984.1270084
