Shortest paths and Steiner trees in VLSI routing (Q3520140)
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: Shortest paths and Steiner trees in VLSI routing |
scientific article; zbMATH DE number 5314280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest paths and Steiner trees in VLSI routing |
scientific article; zbMATH DE number 5314280 |
Statements
20 August 2008
0 references
routing
0 references
very-large-scale integration
0 references
VLSI
0 references
disjoint wire connections
0 references
Steiner trees
0 references
shortest paths
0 references
BonnRoute
0 references
rectilinear Steiner minimum tree
0 references
RSMT
0 references
shortest rectilinear Steiner tree
0 references
rectilinear obstacles
0 references
augmented Hanan grid
0 references
Dijkstra's algorithm
0 references
VLSI routing problem
0 references
0.8564673662185669
0 references
0.8402109146118164
0 references
0.8115258812904358
0 references
0.8073723316192627
0 references
