Abstract
The global routing problem is formulated as a multiterminal, multicommodity flow problem with integer flows. An epsilon bound 2-terminal multicommodity flow algorithm with fractional flows is adapted to handle multiterminal commodities. We show that under certain conditions, our approach derives an approximate optimal solution. The experimental results with benchmark data are quite promising.
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.
