The rectilinear Steiner arborescence problem is NP-complete

Weiping Shi, Chen Su. The rectilinear Steiner arborescence problem is NP-complete. In SODA. pages 780-787, 2000. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: