Abstract
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of capacity B with C compartments, and n items of Q different classes. The problem is to pack the items into the minimum number of bins, where each bin contains items of at most C different classes and has total items size at most B. We present several approximation algorithms for off-line and online versions of the problem.
This work has been partially supported by CAPES, CNPq (Proc. 306526/04–2, 471460/04–4, 490333/04–4) and ProNEx–FAPESP/CNPq (Proc. 2003/09925-5).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, ch. 2, PWS, pp. 46–93 (1997)
Dawande, M., Kalagnanam, J., Sethuraman, J.: Variable sized bin packing with color constraints. Technical report, IBM, T.J. Watson Research Center, NY (1998)
Dawande, M., Kalagnanam, J., Sethuraman, J.: Variable sized bin packing with color constraints. In: Proceedings of Graco 2001. Electronic Notes in Dicrete Mathematics, vol. 7 (2001)
de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1(4), 349–355 (1981)
Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proceedings of SODA, pp. 223–232 (2000)
Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3, 299–325 (1974)
Kashyap, S.R., Khuller, S.: Algorithms for non-uniform size data placement on parallel disks. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 265–276. Springer, Heidelberg (2003)
Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29, 442–467 (2001)
Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. Journal of Scheduling 4(6), 313–338 (2001)
Shachnai, H., Tamir, T.: Approximation schemes for generalized 2-dimensional vector packing with application to data placement. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 165–177. Springer, Heidelberg (2003)
Shachnai, H., Tamir, T.: Tight bounds for online class-constrained packing. Theoretical Computer Science 321(1), 103–123 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xavier, E.C., Miyazawa, F.K. (2006). The Class Constrained Bin Packing Problem with Applications to Video-on-Demand. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_46
Download citation
DOI: https://doi.org/10.1007/11809678_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)