The Rectilinear Steiner Arborescence Problem Is NP-Complete
Collections
Citation
Shi, Weiping; Su, Chen (2005). The Rectilinear Steiner Arborescence Problem Is NP-Complete. SIAM Journal on Computing. Available electronically from https : / /hdl .handle .net /1969 .1 /182684.