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

ISSN： 0025-5610

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

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

Exact and approximation algorithms for a soft rectangle packing problem

By Fügenschuh Armin Junosza-Szaniawski Konstanty Lonc Zbigniew

Optimization, Vol. 63, Iss. 11, 2014-11 ,pp. : 1637-1663

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

By Berman P. DasGupta B. Muthukrishnan S. Ramaswami S.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 443-470

Elsevier

Access to resources Recommend Favorite

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

By Oliveira C. Pardalos P.

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

Springer Publishing Company

Access to resources Recommend Favorite

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 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