Finding All Minimal Shapes in a Routing Channel


We present an algorithm to find a set of all optimal solutions for a channel placement problem. A channel consists of two rows of horizontal line segments (representing components). Each line segment contains some terminals with fixed positions. Sets of terminals, called nets, are to be connected. The relative ordering of line segments in each row is fixed… (More)
DOI: 10.1007/PL00009213


14 Figures and Tables