Abstract
A new approach for approximating the minimum rectilinear Steiner arborescence is presented. The approach yields a simple two-approximation algorithm that runs in O(nlogn) time. Unlike earlier approaches, this can be naturally extended to deal with situations where we have isothetic rectilinear obstacles. This gives us the first O(nlogn) two-approximation algorithm for the rectilinear Steiner arborescence problem in the presence of obstacles.
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 callMore From: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Disclaimer: 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.
