THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD |
scientific article |
Statements
THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (English)
0 references
23 January 2015
0 references
Steiner tree problem
0 references
\(\lambda\)-geometry
0 references
fixed orientation metric
0 references
computational complexity
0 references
NP-hard
0 references
