Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete (Q4268880)
From MaRDI portal
scientific article; zbMATH DE number 1354518
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete |
scientific article; zbMATH DE number 1354518 |
Statements
Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete (English)
0 references
28 October 1999
0 references
single row routing
0 references
VLSI
0 references
\(\mathcal NP\)-complete problems
0 references
minimum wire length
0 references
interval graph
0 references
