Based on graph theory, a study of via minimization problem is presented. We show that the simplest problem of this type is NP-complete and propose a heuristic algorithm for topological via minimization.
Published in:
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
(Volume:3
,
Issue:
3
)
Date of Publication: July 1984