Abstract

A wire-routing problem which arises commonly in the layout of circuits for very large scale integration is discussed. Given the coordinates of terminals u 1, u 2,…, u n of one component and ν 1, α 2, …, ν n of another, the problem is to lay out n wires so that the ith wire connects ν i to ν i , and adjacent wires are separated at least by some fixed distance. The solution with minimum wire length is characterized, and an optimal algorithm which constructs it is presented.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.