抄録
We considered the one-sided single-detour untangling twisted nets problem for printed circuit board bus routing. A previous optimal dynamic programming based O(n 3) algorithm was proposed in a previous work, where n is the number of nets. In this paper, we propose an optimal O(n) untangling algorithm without considering capacity, and this algorithm is further modified to consider capacity. Experimental results show that our algorithms runs much faster than the previous work due to its low time complexity.
本文言語 | English |
---|---|
ホスト出版物のタイトル | Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC |
ページ | 151-156 |
ページ数 | 6 |
DOI | |
出版ステータス | Published - 2012 |
イベント | 17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012 - Sydney, NSW 継続期間: 2012 1月 30 → 2012 2月 2 |
Other
Other | 17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012 |
---|---|
City | Sydney, NSW |
Period | 12/1/30 → 12/2/2 |
ASJC Scopus subject areas
- 電子工学および電気工学
- コンピュータ サイエンスの応用
- コンピュータ グラフィックスおよびコンピュータ支援設計