Abstract
It is shown that, when using Lee's algorithm for interconnection programs, if the order in which the tracks are routed is determined by the distance between the start and end points of each tracks, on average more paths may be placed than if the order is chosen at random.
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 callDisclaimer: 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.
