Author： Lusheng W. Xiaohua J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.215, Iss.1, 1999-02, pp. : 359-370
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
Access to resources
Recommend
Approximations for Steiner trees with minimum number of Steiner points
By Chen
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
Improving spanning trees by upgrading nodes
By Krumke S.O. Noltemeier H. Wirth H.-C. Marathe M.V. Ravi R. Ravi S.S. Sundaram R.
Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. :
Parallel local search for Steiner trees in graphs
By Verhoeven M.G.A. Severens M.E.M.
Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. :