Abstract
Channel routeing, as originally envisaged, can be visualized as constrained colouring of a graph, called a horizontal constraint graph. We describe how this can be effective in real-life channel routeing problems with different kinds of simple heuristics. The problem, without heuristics, is actually combinatorially explosive in nature. Compared with certain benchmark problems, the algorithms give encouraging results. The redeeming features of the algorithms presented here are simplicity, with tolerable results at a faster speed and a classical approach reopened.
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.
