A Topological Global Routing Algorithm For General Cells

An algorithm is presented to accomplish the global routing for general cell routing problems. More specifically, the branch-and-bound method is used to find the minimal cost path that is feasible between two pins on the routing surface. An extension of this algorithm is used to form multipoint nets. The algorithm is described and illustrated.