A near-optimal manhattan channel router for a class of nets with the shift-right-one pattern∗∗This work was supported in part by the National Science Council of the Republic of China under Grant NSC 82-0113-E-110-080-T.

The Manhattan channel routing problem of providing a one-to-one rectilinear wire connection (horizontal segments on one layer, while vertical segments are on the other) between two sets of terminals which lie on two horizontal lines, with the smallest width, is NP-hard. In this paper, it is studied for m consecutive shift-right-one nets, and a near-optimal router which produces a layout with width at most 2 more than the theoretical lower bound given in [1] is presented.