Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing (Q917314)
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: Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing |
scientific article; zbMATH DE number 4155898
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing |
scientific article; zbMATH DE number 4155898 |
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
0 references
