Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing (Q917314): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:10, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing |
scientific article |
Statements
Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing (English)
0 references
1990
0 references
river routing
0 references
approximation bound
0 references
total jogs minimization
0 references
VLSI layout
0 references
greedy approach
0 references
