The Rectilinear Steiner Arborescence Problem Is NP-Complete (Q5470711): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 22:33, 5 March 2024
scientific article; zbMATH DE number 5029547
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Rectilinear Steiner Arborescence Problem Is NP-Complete |
scientific article; zbMATH DE number 5029547 |
Statements
The Rectilinear Steiner Arborescence Problem Is NP-Complete (English)
0 references
1 June 2006
0 references
Steiner tree
0 references
computational complexity
0 references
NP-completeness
0 references
