Weiping Shi, Chen Su. The Rectilinear Steiner Arborescence Problem Is NP-Complete. SIAM Journal on Computing, 35(3):729-740, 2005. [doi]
@article{ShiS05:5,
title = {The Rectilinear Steiner Arborescence Problem Is NP-Complete},
author = {Weiping Shi and Chen Su},
year = {2005},
url = {http://epubs.siam.org/SICOMP/volume-35/art_37135.html},
tags = {completeness},
researchr = {https://researchr.org/publication/ShiS05%3A5},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {35},
number = {3},
pages = {729-740},
}