The uniform orientation Steiner tree problem is NP-hard
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
The uniform orientation Steiner tree problem is NP-hard. / Brazil, Marcus; Zachariasen, Martin.
In: International Journal of Computational Geometry and Applications, Vol. 24, No. 2, 2014, p. 87-105.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Brazil, M & Zachariasen, M 2014, 'The uniform orientation Steiner tree problem is NP-hard', International Journal of Computational Geometry and Applications, vol. 24, no. 2, pp. 87-105. https://doi.org/10.1142/S0218195914500046
APA
Brazil, M., & Zachariasen, M. (2014). The uniform orientation Steiner tree problem is NP-hard. International Journal of Computational Geometry and Applications, 24(2), 87-105. https://doi.org/10.1142/S0218195914500046
Vancouver
Brazil M, Zachariasen M. The uniform orientation Steiner tree problem is NP-hard. International Journal of Computational Geometry and Applications. 2014;24(2):87-105. https://doi.org/10.1142/S0218195914500046
Author
Bibtex
@article{6ec1a6c2ebff4724a94b7d8bde727709,
title = "The uniform orientation Steiner tree problem is NP-hard",
author = "Marcus Brazil and Martin Zachariasen",
year = "2014",
doi = "10.1142/S0218195914500046",
language = "English",
volume = "24",
pages = "87--105",
journal = "International Journal of Computational Geometry and Applications",
issn = "0218-1959",
publisher = "World Scientific Publishing Co. Pte. Ltd.",
number = "2",
}
RIS
TY - JOUR
T1 - The uniform orientation Steiner tree problem is NP-hard
AU - Brazil, Marcus
AU - Zachariasen, Martin
PY - 2014
Y1 - 2014
U2 - 10.1142/S0218195914500046
DO - 10.1142/S0218195914500046
M3 - Journal article
VL - 24
SP - 87
EP - 105
JO - International Journal of Computational Geometry and Applications
JF - International Journal of Computational Geometry and Applications
SN - 0218-1959
IS - 2
ER -
ID: 128890253