Linear optimal one-sided single-detour algorithm for untangling twisted bus

Tao Lin, Sheqin Dong, Song Chen, Satoshi Goto

研究成果: Conference contribution

2 引用 (Scopus)

抜粋

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 302012 2 2

Other

Other17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012
Sydney, NSW
期間12/1/3012/2/2

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

フィンガープリント Linear optimal one-sided single-detour algorithm for untangling twisted bus' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Lin, T., Dong, S., Chen, S., & Goto, S. (2012). Linear optimal one-sided single-detour algorithm for untangling twisted bus. : Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC (pp. 151-156). [6164936] https://doi.org/10.1109/ASPDAC.2012.6164936