Fingerprint
Dive into the research topics of 'The uniform orientation Steiner tree problem is NP-hard: International Journal of Computational Geometry & Applications'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
The uniform orientation Steiner tree problem is NP-hard: International Journal of Computational Geometry & Applications
Marcus Brazil, Martin Zachariasen
Research output: Contribution to journal › Article › peer-review
3
Citations
(Scopus)