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

Tao Lin, Sheqin Dong, Song Chen, Satoshi Goto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Pages151-156
Number of pages6
DOIs
Publication statusPublished - 2012
Event17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012 - Sydney, NSW
Duration: 2012 Jan 302012 Feb 2

Other

Other17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012
CitySydney, NSW
Period12/1/3012/2/2

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Linear optimal one-sided single-detour algorithm for untangling twisted bus'. Together they form a unique fingerprint.

  • Cite this

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