Loading...
Please wait, while we are loading the content...
Similar Documents
Compact Channel Routing of Multiterminal Nets
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sarrafzadeh, Majid Preparata, Franco P. |
| Copyright Year | 1985 |
| Abstract | In this paper we describe a novel technique for solving the channel routing problem of multiterminal nets. The layout is produced column-by-column in a left-to-right scan: the number t of used tracks satisfies the bound δ ≤ t ≤ δ+α(0 ≤ δ−1), where δ is the density of the problem. The technique behaves equivalently to known optimal methods for two-terminal net problems. For a channel routing problem with C columns and n nets, the algorithms run in time O(Clogn) and produces layouts that are provably wirable in three layers. |
| Starting Page | 255 |
| Ending Page | 279 |
| Page Count | 25 |
| File Format | PDF HTM / HTML |
| DOI | 10.1016/S0304-0208(08)73111-6 |
| Alternate Webpage(s) | https://www.ideals.illinois.edu/bitstream/handle/2142/74242/B37-ACT_44.pdf?isAllowed=y&sequence=2 |
| Alternate Webpage(s) | https://doi.org/10.1016/S0304-0208%2808%2973111-6 |
| Volume Number | 109 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |