Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A heuristic single-row router minimizing interstreet crossings

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)
Batalama, S.N. ; Dept. of Electr. Eng., Virgina Univ., Charlottesville, VA, USA ; Pados, D.A. ; Papatheodorou, T.S.

The problem of minimizing the number of interstreet crossings in single-row routing, known to be intractable in the sense of NP-completeness is studied. An efficient heuristic algorithm for solving this problem is presented. The worst-case computational complexity of the algorithm is O(mn+m3), where n is the number of nodes and mn/2 is the number of nets. Some theoretical work regarding lower bounds for the total number of interstreet crossings needed to realize a given netlist is also presented. Examples are given in which the theoretical bounds coincide with the required minimum. Moreover, in several cases, this theoretical minimum is achieved by the present algorithm thus demonstrating its efficiency. Besides it obvious importance in integrated circuits design, such an algorithm can also be useful for implementing channel and switch-box routers which minimize the number of required vias in multilayer printed wiring boards

Published in:

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