Optimal algorithms for adjacent side routing (Q802877): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Joseph F. Ja'Ja' / rank | |||
| Property / author | |||
| Property / author: Joseph F. Ja'Ja' / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BEAVER / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Three-Layer Channel Routing / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:54, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal algorithms for adjacent side routing |
scientific article |
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
