Channel-Routing Problem in the Knock-Knee Mode Is NP-Complete

We will show that it is NP-Complete to decide whether an arbitrary instance of the channel-routing problem in the knock-knee mode can be laid out optimally. This result is extended to problems (arising in practice) involving nets of bounded degree

[1]  Gary L. Miller,et al.  Provably Good Channel Routing Algorithms , 1981 .

[2]  Majid Sarrafzadeh,et al.  Compact Channel Routing of Multiterminal Nets , 1985 .

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

[4]  Thomas G. Szymanski.  Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.