Issue No.06 - June (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2210
The authors study the via assignment problem when vias are allowed to appear rowwise as well as columnwise. Previously they proved that the problem belongs to the class of NP-hard problems and therefore it is unlikely that polynomial-time algorithms exist for solving the problem. Two heuristics (HEU1 and HEU2) to solve the problem were proposed. HEU1 splits the nets before any routing is done w
two-dimensional via assignment; single-row routing; NP-hard problems; polynomial-time algorithms; HEU1; HEU2; circuit layout CAD; directed graphs; printed circuits.
H.C. Du, O.H. Ibarra, J.F. Naveda, "On Two-Dimensional Via Assignment for Single-Row Routing", IEEE Transactions on Computers, vol.37, no. 6, pp. 721-727, June 1988, doi:10.1109/12.2210