论文信息 - Via assignment problem in multilayer printed circuit board

Via assignment problem in multilayer printed circuit board

In the routing of a multilayer printed circuit board an important phase is the via assignments. In this paper, the via assignment problem is given a graph theoretic formulation. Some related optimization problems are proven to belong to a particular class of hard combinatorial problem: the class of nondeterministic polynomial (NP)-complete problems. This result suggests that the only way to solve efficiently the optimization problems is to introduce heuristic algorithms. Hence, some heuristic algorithms a proposed and their performances are evaluated.

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3] E. Kuh,et al. The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer case , 1976 .

[4] Shigeki Goto,et al. Suboptimum solution of the back-board ordering with channel capacity constraint , 1977 .

[5] David S. Johnson. Approximation algorithms for combinatorial problems , 1973, STOC '73.

[6] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.