Abstract
We define a strictly multiterminal (smt) channel routing problem (CRP) as one totally composed of smt-nets, that is nets with more than one entry terminal and more than one exit terminal. We show that any strictly multiterminal channel routing problem can be routed in a channel of height 3 d in the Manhattan model (hence, in the knock-knee model), and of height 6 d, or 6 d + 2, in a diagonal model where d is the density of the CRP. The routing algorithm is also useful for general CRPs, if the number of smt-nets is predominant.
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.
