Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Sarrafzadeh, M. ; Department of Electrical Engineering and Computer Science, The Technological Institute, Northwestern University, Evanston, IL, USA

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

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:6 ,  Issue: 4 )