An Unconstrained Topological Via Minimization Problem for Two-Layer Routing

TitleAn Unconstrained Topological Via Minimization Problem for Two-Layer Routing
Publication TypeJournal Article
Year of Publication1984
AuthorsMarek-Sadowska, M
JournalComputer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Volume3
Pagination184 - 190
Date Publishedjuly
ISSN0278-0070
AbstractBased 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.
DOI10.1109/TCAD.1984.1270074