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

On the Ordering of Connections for Automatic Wire Routing

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

1 Author(s)
Abel, L.C. ; Digital Equipment Corporation

Most wire-routing programs utilize a maze-running technique to route one connection at a time. Once routed, a wire cannot be moved even if it is subsequently discovered to interfere with the successful completion of other connections. The order in which the desired connections are presented to the routing algorithm has therefore been thought to be of critical importance. Experimental evidence is presented, however, to show that the performance of a router, when measured in terms of the total of the minimum (or ideal) lengths of the connections successfully completed, is, in fact, independent of the order in which connections are attempted.

Published in:

Computers, IEEE Transactions on  (Volume:C-21 ,  Issue: 11 )

Date of Publication:

Nov. 1972

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.