Issue No.05 - May (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.4616
The layer assignment problem for interconnect is the problem of determining which layers should be used for wiring the signal nets so that the number of vias is minimized. The problem is often referred to as the via minimization problem. The problem is considered for three-layer routing, concentrating on one version called the constrained via minimization (CVM3) problem. It is shown that the CV
three-layer routing; layer assignment; signal nets; constrained via minimization; CVM3; NP-complete; heuristic algorithm; circuit layout CAD; computational complexity; heuristic programming; minimisation; VLSI.
K.C. Chang, "Layer Assignment Problem for Three-Layer Routing", IEEE Transactions on Computers, vol.37, no. 5, pp. 625-632, May 1988, doi:10.1109/12.4616