Optimal Algorithms for Adjacent Side Routing

Download PDF
Open Webpage

S. Alice Wu, Joseph F. JáJá

Published: 1991, Last Modified: 15 May 2025Algorithmica 1991EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We consider the switchbox routing problem of two-terminal nets in the case when all thek nets lie on two adjacent sides of the rectangle. Our routing model is the standard two-layer model. We develop an optimal algorithm that routes all the nets whenever a routing exists. The routing obtained uses the fewest possible number of vias. A more general version of this problem (adjacent staircase) is also optimally solved.