![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Voß S.
Publisher: Springer Publishing Company
ISSN: 0254-5330
Source: Annals of Operations Research, Vol.86, Iss.1, 1999-01, pp. : 321-345
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the approximability of the Steiner tree problem
By Thimm M.
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Lu C.L. Tang C.Y. Lee R.C.-T.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the partial terminal Steiner tree problem
By Hsieh Sun-Yuan Gao Huang-Ming
The Journal of Supercomputing, Vol. 41, Iss. 1, 2007-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On approximation algorithms for the terminal Steiner tree problem
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :