The Rectilinear Steiner Tree Problem is $NP$-Complete (Q4179026): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:02, 6 February 2024
scientific article; zbMATH DE number 3614797
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Rectilinear Steiner Tree Problem is $NP$-Complete |
scientific article; zbMATH DE number 3614797 |
Statements
The Rectilinear Steiner Tree Problem is $NP$-Complete (English)
0 references
1977
0 references
Steiner Tree Problem
0 references
Np-Complete
0 references
Net Wiring Patterns
0 references
