The Rectilinear Steiner Tree Problem is $NP$-Complete (Q4179026): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56338024, #quickstatements; #temporary_batch_1707252663060 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: David S. Johnson / rank | |||
| Property / author | |||
| Property / author: David S. Johnson / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0132071 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020112047 / rank | |||
Normal rank | |||
Latest revision as of 22:03, 19 March 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
