Abstract
We give algorithms to minimize density for VLSI channel-routing problems with terminals that are movable subject to certain constraints. The main cases considered are channels with linear-order constraints, channels with linear-order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case we improve previous results for running time and space by a factor ofL/lgn andL, respectively, whereL is the channel length andn is the number of terminals.
Sign-in/Register to access full text options 
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.
