On Two-Dimensional Via Assignment for Single-Row Routing

Authors:
H. C. Du;Oscar H. Ibarra;Fernando Naveda
Affiliations:
University of Minnesota, Minneapolis;University of Minnesota, Minneapolis;University of Minnesota, Minneapolis
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 3
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
TWIGY - a topological algorithm based routing system

DAC '81 Proceedings of the 18th Design Automation Conference
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	14.98

Visualization

Abstract

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 while HEU2 assigns the nets alternately to via rows and via columns. Here they modify HEU2 so that the side of the board to which the nets are assigned first for connection is selected according to a desired ratio of board width to height.