An efficient one-side height minimization algorithm for routing around a rectangle (Q1201874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 98615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient one-side height minimization algorithm for routing around a rectangle |
scientific article; zbMATH DE number 98615 |
Statements
An efficient one-side height minimization algorithm for routing around a rectangle (English)
0 references
17 January 1993
0 references
analysis of algorithms
0 references
data structures
0 references
design of algorithms
0 references
detailed routing around a rectangle
0 references
optimization
0 references
priority queue
0 references
grid-based wiring
0 references
VLSI
0 references
0.8107932806015015
0 references
0.8029523491859436
0 references
0.8020622134208679
0 references
0.7772753238677979
0 references
0.7677381038665771
0 references
