River routing in VLSI (Q1102106): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(87)90004-3 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017153896 / rank | |||
Revision as of 08:27, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | River routing in VLSI |
scientific article |
Statements
River routing in VLSI (English)
0 references
1987
0 references
The main result of this well written and interesting paper is an O(n) time algorithm for the optimum offset problem in single-layer river routing. The result is achieved using a halving technique which is claimed to be new, but is merely a variant of the old divide-and-conquer paradigm. Algorithms for the minimum area, minimum longest wire length and minimum total wire length problems are also given that take \(O(n^ 2)\) time.
0 references
VLSI layout
0 references
algorithm design technique
0 references
single-layer wiring
0 references
river routing
0 references
