Short Wire Routing in Convex Grids

Knock-knee routing of two-terminal nets is mathematically modelled and successfully solved in a lot of settings by multicommodity-flow techniques. The primary goal of routing, the fast construction of a solution whenever it exists at all, is thus well understood and controlled.

[1]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[2]  Franco P. Preparata,et al.  Optimal Three-Layer Channel Routing , 1984, IEEE Transactions on Computers.

[3]  Nobuji Saito,et al.  A Linear-Time Routing Algorithm for Convex Grids , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Dorothea Wagner,et al.  Area-optimal three-layer channel routing , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  András Frank,et al.  Disjoint paths in a rectilinear grid , 1982, Comb..

[6]  Alan P. Sprague,et al.  On the Routability of a Convex Grid , 1987, J. Algorithms.

[7]  Majid Sarrafzadeh.  Channel routing with provably short wires , 1987 .

[8]  Kurt Mehlhorn,et al.  Routing Through a Generalized Switchbox , 1986, J. Algorithms.

[9]  Dorothea Wagner,et al.  Routing through a dense channel with minimum total wire length , 1991, SODA '91.