Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks

Author： Oliveira C.   Pardalos P.  

Publisher： Springer Publishing Company

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.41, Iss.6, 2005-11, pp. : 898-908

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

Approximation algorithms for multicast routing in ad hoc wireless networks

By Li Deying  

Journal of Combinatorial Optimization, Vol. 21, Iss. 3, 2011-04 ,pp. : 293-305

Springer Publishing Company

Access to resources Recommend Favorite

Approximation algorithms for general packing problems and their application to the multicast congestion problem

By Jansen Klaus  

Mathematical Programming, Vol. 114, Iss. 1, 2008-07 ,pp. : 183-206

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for the Class Cover Problem

By Cannon Adam H.  

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 215-223

Springer Publishing Company

Access to resources Recommend Favorite

Topology based placement of multicast capable nodes for supporting efficient multicast communication in WDM optical networks

By Billah Abdur   Wang Bin   Awwal Abdul  

Photonic Network Communications, Vol. 14, Iss. 1, 2007-08 ,pp. : 35-47

Springer Publishing Company

Access to resources Recommend Favorite

On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks

By Cai Hongxu   Zhao Yingchao  

Journal of Combinatorial Optimization, Vol. 9, Iss. 3, 2005-05 ,pp. : 243-262

Springer Publishing Company

Access to resources Recommend Favorite