TY - GEN
T1 - Ordered escape routing based on boolean satisfiability
AU - Luo, Lijuan
AU - Wong, Martin D.F.
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=49549099953&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=49549099953&partnerID=8YFLogxK
U2 - 10.1109/ASPDAC.2008.4483950
DO - 10.1109/ASPDAC.2008.4483950
M3 - Conference contribution
AN - SCOPUS:49549099953
SN - 9781424419227
T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
SP - 244
EP - 249
BT - 2008 Asia and South Pacific Design Automation Conference, ASP-DAC
T2 - 2008 Asia and South Pacific Design Automation Conference, ASP-DAC
Y2 - 21 March 2008 through 24 March 2008
ER -