Provably Good Parallel Algorithms for Channel Routing of Multi-Terminal Nets.

摘要

We consider the channel ronting problem of a set of multi-terminal nets in the knock-knee model. We develop a new approach to route all the nets within d+ alpha tracks, where d is the channel density, and 0.