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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.