A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

By Prömel H.J.   Steger A.  

Journal of Algorithms, Vol. 36, Iss. 1, 2000-07 ,pp. : 89-101

Academic Press

Access to resources Recommend Favorite

Differential approximation results for the Steiner tree problem

By Demange M.   Monnot J.   Paschos V.T.  

Applied Mathematics Letters, Vol. 16, Iss. 5, 2003-07 ,pp. : 733-739

Elsevier

Access to resources Recommend Favorite

An efficient approximation algorithm for the survivable network design problem

By Gabow H.N.   Goemans M.X.   Williamson D.P.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 13-40

Elsevier

Access to resources Recommend Favorite

An Improved Approximation Algorithm for Multicast k-Tree Routing

By Lin Guohui  

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 349-356

Springer Publishing Company

Access to resources Recommend Favorite

A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

By Hong S.-P.   Chung S.-J.   Park B.H.  

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 233-239

Elsevier

Access to resources Recommend Favorite