An exact algorithm for solving difficult detailed routing problems

Channel routing is an NP-complete problem. Therefore, it is likely that there is no efficient algorithm solving this problem exactly.In this paper, we show that channel routing is a fixed-parameter tractable problem and 
Channel routing is an NP-complete problem. Therefore, it is likely that there is no efficient algorithm solving this problem exactly.In this paper, we show that channel routing is a fixed-parameter tractable problem and that we can find a solution in linear time for a fixed channel width.We implemented our approach for the restricted layer model. The algorithm finds an optimal route for channels with up to 13 tracks within minutes or up to 11 tracks within seconds.Such narrow channels occur for example as a leaf problem of hierarchical routers or within standard cell generators.
show moreshow less

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

    Share in Twitter Search Google Scholar
Metadaten
Author:Kolja Sulimma, Wolfgang Kunz
URN:urn:nbn:de:hebis:30-25242
ISBN:1-58113-347-2
Parent Title (German):Proceedings of the 2001 international symposium on Physical design, ISPD’01, April 14, 2001Sonoma, California, S. 198-203 , ISBN: 1-58113-347-2
Publisher:ACM
Document Type:Article
Language:English
Date of Publication (online):2006/03/21
Year of first Publication:2001
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2006/03/21
Pagenumber:6
First Page:198
Last Page:203
Source:Proceedings of the 2001 international symposium on Physical design, Sonoma, California, p. 198 - 203 , ISBN:1-58113-347-2;©2001 ACM
HeBIS PPN:226454762
Institutes:Informatik
Dewey Decimal Classification:004 Datenverarbeitung; Informatik
Sammlungen:Universitätspublikationen
Licence (German):License Logo Veröffentlichungsvertrag für Publikationen

$Rev: 11761 $