Loading...
Please wait, while we are loading the content...
Similar Documents
A New Algorithm for 2 – layer Manhattan Channel Routing
| Content Provider | Semantic Scholar |
|---|---|
| Author | Szeszlér, Dávid |
| Copyright Year | 2008 |
| Abstract | Channel routing in the 2–layer Manhattan model is one of the most investigated problems in detailed routing. Finding a minimum width solution was proved to be NP–hard by Szymanski [8]. In this paper we give a complete characterization of all specifications that are solvable if the width can be arbitrarily large, but the length of the channel cannot be extended by introducing extra columns. Furthermore, we present a linear time algorithm to solve these specifications with a width at most constant times the length of the problem. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.bme.hu/~szeszler/japhun_2003.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |