On the hardness of full Steiner tree problems

Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid. On the hardness of full Steiner tree problems. J. Discrete Algorithms, 34:118-127, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.