Abstract
Minimum rectilinear Steiner tree (MRST) construction is a fundamental problem in VLSI routing, combinational optimization and computational geometry. In this paper, a novel approach based on the combination of geometric analysis, integer linear programming and branch & bound algorithm is presented to construct MRST efficiently. Firstly, an integer linear programming model of MRST problem is built well versed in binding with special features of solution space. Then in order to depress the high computational complexity of constructing MRST, geometric analysis and the branch and bound algorithm are introduced to optimize search space. Experimental results demonstrated the capabilities of the proposed approach to build MRST with high accuracy and efficiency.
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.
