A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology

ISSN： 0178-4617

Source： Algorithmica, Vol.41, Iss.1, 2004-10, pp. : 53-72

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

Related content

Delay-Constrained, Low-Cost Multicast Routing in Multimedia Networks

By Alrabiah T. Znati T.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 9, 2001-09 ,pp. : 1307-1336

Academic Press

Access to resources Recommend Favorite

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

By Gouveia Luis

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 19-39

Springer Publishing Company

Access to resources Recommend Favorite

Parallel approximation algorithms for minimum routing cost spanning tree

By Chen Kun Hsieh Yung En Lu Ping Jung

International Journal of Computational Science and Engineering, Vol. 8, Iss. 4, 2013-10 ,pp. : 336-348

Inderscience Publishers

Access to resources Recommend Favorite

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

By Schuurman P. Woeginger G.J.

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 105-122

Elsevier

Access to resources Recommend Favorite

An asymptotic fully polynomial time approximation scheme for bin covering

By Jansen K. Solis-Oba R.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 543-551

Elsevier

Access to resources Recommend Favorite