The Rectilinear Steiner Arborescence Problem Is NP-Complete

Weiping Shi, Chen Su. The Rectilinear Steiner Arborescence Problem Is NP-Complete. SIAM Journal on Computing, 35(3):729-740, 2005. [doi]

Authors

Weiping Shi

This author has not been identified. Look up 'Weiping Shi' in Google

Chen Su

This author has not been identified. Look up 'Chen Su' in Google