Cart (Loading....) | Create Account
Close category search window

On VHV-routing in channels with irregular boundaries

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

3 Author(s)
Vijayan, G. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Chen, H.H. ; Wong, C.K.

A description is given of the VHV-channel-routing problem in irregular channels. The authors describe a branch-and-bound algorithm for finding optimal solutions for this problem. The algorithm partitions the channels into boxes and searches for the optimal among the various mappings of the horizontal net segments to the boxes. The authors discuss three different branching strategies for the algorithm. Heuristic algorithms based on the branching strategies are also discussed. It is also shown that VHV routing is NP-hard for irregular channels

Published in:

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

Date of Publication:

Feb 1989

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.