THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD
From MaRDI portal
Publication:2939916
DOI10.1142/S0218195914500046zbMath1319.68227MaRDI QIDQ2939916
Could not fetch data.
Publication date: 23 January 2015
Published in: (Search for Journal in Brave)
Could not fetch data.
Could not fetch data.
This page was built for publication: THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD