On approximation algorithms for the terminal Steiner tree problem

Author： Drake D.E.   Hougardy S.  

Publisher： Elsevier

ISSN： 0020-0190

Source： Information Processing Letters, Vol.89, Iss.1, 2004-01, pp. : 15-18

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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. : 41-52

Springer Publishing Company

Access to resources Recommend Favorite

A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

By Bezenšek Mitja   Robič Borut  

International Journal of Parallel Programming, Vol. 42, Iss. 2, 2014-04 ,pp. : 287-319

Springer Publishing Company

Access to resources Recommend Favorite

On the approximability of the Steiner tree problem

By Thimm M.  

Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. : 387-402

Elsevier

Access to resources Recommend Favorite

The full Steiner tree problem

By Lu C.L.   Tang C.Y.   Lee R.C.-T.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 55-67

Elsevier

Access to resources Recommend Favorite

Improved Approximation Algorithms for the Average-Case Tree Searching Problem

By Cicalese Ferdinando   Jacobs Tobias   Laber Eduardo   Molinaro Marco  

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 1045-1074

Springer Publishing Company

Access to resources Recommend Favorite