Author： Bezenšek Mitja Robič Borut
Publisher： Springer Publishing Company
ISSN： 0885-7458
Source： International Journal of Parallel Programming, Vol.42, Iss.2, 2014-04, pp. : 287-319
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
On approximation algorithms for the terminal Steiner tree problem
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
On the approximability of the Steiner tree problem
By Thimm M.
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
By Lu C.L. Tang C.Y. Lee R.C.-T.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
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. :
The Steiner tree problem with hop constraints
By Voß S.
Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. :