Abstract
We consider a memory allocation problem that can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. This problem was recently introduced by Chung et al.[3]. We give a simple 3/2-approximation algorithm for it which is in fact an online algorithm. This algorithm also has good performance for the more general case where each bin may contain at most k parts of items. We show that this general case is also strongly NP-hard. Additionally, we give an efficient 7/5-approximation algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics 143(1-3), 238–251 (2004)
Caprara, A., Kellerer, H., Pferschy, U.: Approximation schemes for ordered vector packing problems. Naval Research Logistics 92, 58–69 (2003)
Chung, F., Graham, R., Mao, J., Varghese, G.: Parallelism versus memory allocation in pipelined router forwarding engines. Theory of Computing Systems 39(6), 829–849 (2006)
Epstein, L.: Online bin packing with cardinality constraints. SIAM Journal on Discrete Mathematics 20(4), 1015–1030 (2006)
Epstein, L., van Stee, R.: Approximation schemes for packing splittable items with cardinality constraints. Manuscript
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Graham, R.L., Mao, J.: Parallel resource allocation of splittable items with cardinality constraints. Manuscript
Johnson, D.S.: Fast algorithms for bin packing. Journal of Computer and System Sciences 8(3), 272–314 (1974)
Kellerer, H., Pferschy, U.: Cardinality constrained bin-packing problems. Annals of Operations Research 92, 335–348 (1999)
Krause, K.L., Shen, V.Y., Schwetman, H.D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 22(4), 522–550 (1975)
Krause, K.L., Shen, V.Y., Schwetman, H.D.: Errata: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 24(3), 527 (1977)
Shachnai, H., Tamir, T., Yehezkely, O.: Approximation schemes for packing with item fragmentation. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 334–347. Springer, Heidelberg (2006)
van Vliet, A.: An improved lower bound for online bin packing algorithms. Information Processing Letters 43(5), 277–284 (1992)
Yao, A.C.C.: New algorithms for bin packing. Journal of the ACM 27, 207–227 (1980)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Epstein, L., van Stee, R. (2007). Improved Results for a Memory Allocation Problem. In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)