Abstract
In this paper we study the channel routing problem (CRP) in a new routing model, called Overlap Diagonal Model (ODM), where the grid consists of right and left tracks displayed at +45° and −45°. For the unrestrictedoverlap, we present an algorithm which achieves\(w = \left[ {\frac{d}{2}} \right] + 1\), while for the restricted-overlap, we havew=d+1, whered is the channel density,w is the channel width.
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.
