Abstract
We consider two variants of the classical bin packing problem in which items may be fragmented. This can potentially reduce the total number of bins needed for packing the instance. However, since fragmentation incurs overhead, we attempt to avoid it as much as possible. In bin packing with size increasing fragmentation (BP-SIF), fragmenting an item increases the input size (due to a header/footer of fixed size that is added to each fragment). In bin packing with size preserving fragmentation (BP-SPF), there is a bound on the total number of fragmented items. These two variants of bin packing capture many practical scenarios, including message transmission in community TV networks, VLSI circuit design and preemptive scheduling on parallel machines with setup times/setup costs.
While both BP-SPF and BP-SIF do not belong to the class of problems that admit a polynomial time approximation scheme (PTAS), we show in this paper that both problems admit a dual PTAS and an asymptotic PTAS. We also develop for each of the problems a dual asymptotic fully polynomial time approximation scheme (AFPTAS). The AFPTASs are based on a non-trivial application of a fast combinatorial FPTAS for packing linear programs with negative entries, proposed recently by Garg and Khandekar [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.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing, Boston (1997)
de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1, 349–355 (1981)
Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 151–162. Springer, Heidelberg (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)
Garg, N., Khandekar, R.: Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 371–382. Springer, Heidelberg (2004)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica I, 169–197 (1981)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Practical and theoretical results. Journal of the ACM 34(1), 144–162 (1987)
Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one dimensional bin packing problem. In: Proc. 23rd IEEE Annual Symposium on Foundations of Computer Science, pp. 312–320 (1982)
Khandekar, R.: Lagrangian relaxation based algorithms for convex programming problems. PhD thesis, Indian Institute of Technology Delhi (2004), http://www.cse.iitd.ernet.in/~rohitk
Mandal, C.A., Chakrabarti, P.P., Ghose, S.: Complexity of fragmentable object bin packing and an application. Computers and Mathematics with Applications 35(11), 91–97 (1998)
McNaughton, R.: Scheduling with deadlines and loss functions. Manage. Sci. 6, 1–12 (1959)
Menakerman, N., Rom, R.: Bin Packing with Item Fragmentation. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, p. 313. Springer, Heidelberg (2001)
Motwani, R.: Lecture notes on approximation algorithms. Technical report, Dept. of Computer Science, Stanford Univ., CA (1992)
Multimedia Cable Network System Ltd., Data-Over-Cable Service Interface Specification (2000), http://www.cablelabs.com
Naaman, N., Rom, R.: Packet Scheduling with Fragmentation. In: Proc. of INFOCOM 2002, pp. 824–831 (2002)
Shachnai, H., Tamir, T., Woeginger, G.J.: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42, 309–334 (2005)
Shachnai, H., Tamir, T., Yehezkely, O.: Approximation Schemes for Packing with Item Fragmentation, Full version, http://www.cs.technion.ac.il/~hadas/PUB/frag.pdf
Vazirani, V.V.: Bin Packing. In: Approximation Algorithms, pp. 74–78. Springer, Heidelberg (2001)
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
Shachnai, H., Tamir, T., Yehezkely, O. (2006). Approximation Schemes for Packing with Item Fragmentation. In: Erlebach, T., Persinao, G. (eds) Approximation and Online Algorithms. WAOA 2005. Lecture Notes in Computer Science, vol 3879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671411_26
Download citation
DOI: https://doi.org/10.1007/11671411_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32207-8
Online ISBN: 978-3-540-32208-5
eBook Packages: Computer ScienceComputer Science (R0)