By Topic

On the k-layer planar subset and topological via minimization problems

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cong, J. ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; Liu, C.L.

Two closely related problems important for performance-driven layout design, the k-layer planar subset problem (k-PSP) and the k-layer topological via minimization problem, are studied. It is shown that both are NP-complete. Moreover, both problems can be solved in polynomial time when the routing regions are crossing channels. It can be shown that under a suitable assumption, all the channels for interblock connections in the general cell design style are crossing channels. The algorithms are based on an efficient algorithm for computing a maximum weighted k -cofamily in a partially ordered set

Published in:

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