Optimal algorithms for adjacent side routing (Q802877)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal algorithms for adjacent side routing |
scientific article; zbMATH DE number 4199640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for adjacent side routing |
scientific article; zbMATH DE number 4199640 |
Statements
Optimal algorithms for adjacent side routing (English)
0 references
1991
0 references
We consider the switchbox routing problem of two-terminal nets in the case when all the k nets lie on two adjacent sides of the rectangle. Our routing model is the standard two-layer model. We develop an optimal algorithm that routes all the nets whenever a routing exists. The routing obtained uses the fewest possible number of vias. A more general version of this problem (adjacent staircase) is also optimally solved.
0 references
VLSI routing
0 references
switchbox routing
0 references
0.836018979549408
0 references
0.8105063438415527
0 references
0.809715211391449
0 references
0.8065855503082275
0 references
