Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

MP
2008

favoriteEmaildiscussreport

104views more MP 2008»

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

14 years 10 months ago

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

Download www.ece.mtu.edu

Klaus Jansen, Hu Zhang

Real-time Traffic

MP 2008 |

claim paper

Related Content

» Implementation of Approximation Algorithms for the Multicast Congestion Problem

» Improved approximation algorithms for multidimensional bin packing problems

» Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

» An Approximation Algorithm for the General Mixed Packing and Covering Problem

» Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

» Solving Packing Problem with Weaker Block Solvers

» Practical Approximation Algorithms for Separable Packing Linear Programs

» The Class Constrained Bin Packing Problem with Applications to VideoonDemand

» Greedy Approximation via Duality for Packing Combinatorial Auctions and Routing

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	MP
Authors	Klaus Jansen, Hu Zhang

Comments (0)