Ordered escape routing based on Boolean satisfiability

Lijuan Luo, Martin D. F. Wong

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

48 Citations (Scopus)

Abstract

Routing for high-speed boards is largely a time-consuming manual task today. In this work we consider the ordered escape routing problem which is a key problem in board-level routing. All existing approaches to this problem cannot guarantee to find a routing solution even if one exists. We present an algorithm to exactly solve this problem based on Boolean satisfiability. Experimental results on escape routing problems from industry show that our algorithm performs well.

Original languageEnglish
Title of host publicationProceedings of The 13th Asia and South Pacific Design Automation Conference, ASP-DAC 2008
PublisherIEEE
Pages244-249
Number of pages6
ISBN (Print)9781424419210
DOIs
Publication statusPublished - 22 Jan 2008
Event13th Asia and South Pacific Design Automation Conference, ASP-DAC 2008 - COEX, Seoul, Korea, Republic of
Duration: 21 Jan 200824 Jan 2008
https://www.aspdac.com/aspdac2008/ (Conference website)
https://www.aspdac.com/aspdac2008/ASP-DAC2008.pdf (Conference programme)
https://ieeexplore.ieee.org/xpl/conhome/4480121/proceeding (Conference proceedings)

Publication series

NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
ISSN (Print)2153-6961
ISSN (Electronic)2153-697X

Conference

Conference13th Asia and South Pacific Design Automation Conference, ASP-DAC 2008
Country/TerritoryKorea, Republic of
CitySeoul
Period21/01/0824/01/08
Internet address

Scopus Subject Areas

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

Fingerprint

Dive into the research topics of 'Ordered escape routing based on Boolean satisfiability'. Together they form a unique fingerprint.

Cite this