Optimal algorithms for adjacent side routing (Q802877)

We consider the switchbox routing problem of two-terminal nets in the case when all the k 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.