The Rectilinear Steiner Arborescence Problem Is NP-Complete (Q5470711): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539704371353 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150488380 / rank | |||
Normal rank | |||
Latest revision as of 12:01, 30 July 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
