Referenced Items are not available for this document.
We present a construction-by-correction approach to solve the obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction problem. We build an obstacle-weighted spanning tree as a guidance to construct OARSMT on an escape graph. We use Dijkstra's algorithm for routing. A refinement of U- shaped removal is applied during the routing process to further reduce the wire length. Our experimental results show that comparing to several state-of-the-art works this algorithm achieves the shortest average total wire length. It also uses short run time for practical-size problems.
Published in:
VLSI Design, Automation and Test, 2008. VLSI-DAT 2008. IEEE International Symposium on
Date of Conference: 23-25 April 2008
- Page(s):
- 35 - 38
- E-ISBN :
- 978-1-4244-1617-2
- Print ISBN:
- 978-1-4244-1616-5
- INSPEC Accession Number:
- 10056928
- Conference Location :
- Hsinchu
- Digital Object Identifier :
- 10.1109/VDAT.2008.4542406
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
