Related content

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

By Wu B.Y.   Chao K-M.   Tang C.Y.  

Journal of Algorithms, Vol. 36, Iss. 2, 2000-08 ,pp. : 182-204

Academic Press

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

Polynomial time approximation schemes for minimum disk cover problems

By Liao Chen   Hu Shiyan  

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 399-412

Springer Publishing Company

Access to resources Recommend Favorite

On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

By Mikhailyuk V.  

Cybernetics and Systems Analysis, Vol. 47, Iss. 3, 2011-05 ,pp. : 368-374

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial time approximation algorithm for the two-commodity splittable flow problem

By Eisenschmidt Elke   Haus Utz-Uwe  

Mathematical Methods of Operations Research, Vol. 77, Iss. 3, 2013-06 ,pp. : 381-391

Springer Publishing Company

Access to resources Recommend Favorite