Abstract
Suppose that we have a set of items and a set of devices, each possessing two limited resources. Each item requires a given amount of the resources. Further, each item is associated with a profit and a color, and items of the same color can share the use of one resource. We need to allocate the resources to the most profitable (feasible) subset of items. In alternative formulation, we need to pack the most profitable subset of items in a set of 2-dimensional bins (knapsacks), in which the capacity in one dimension is sharable. Indeed, the special case where we have a single item in each color is the well-known 2-dimensional vector packing (2DVP) problem. Thus, the problem that we study is strongly NP-hard for a single bin, and MAX-SNP hard for multiple bins. Our problem has several important applications, including data placement on disks in media-on-demand systems.
We present approximation algorithms as well as optimal solutions for some instances. In some cases, our results are similar to the best known results for 2DVP. Specifically, for a single knapsack, we show that our problem is solvable in pseudo-polynomial time and develop a polynomial time approximation scheme (PTAS) for general instances. For a natural subclass of instances we obtain a simpler scheme. This yields the first combinatorial PTAS for a non-trivial subclass of instances for 2DVP. For multiple knapsacks, we develop a PTAS for a subclass of instances arising in the data placement problem. Finally, we show that when the number of distinct colors in the instance is fixed, our problem admits a PTAS, even if the items have arbitrary sizes and profits, and the bins are arbitrary.
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
Chekuri, C., Khanna, S.: On Multi-dimensional Packing Problems. In: Proc. of SODA, pp. 185–194 (1999)
Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Proc. of SODA, pp. 213–222 (2000)
Frieze, A.M., Clarke, M.R.B.: Approximation Algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses. European J. of Operational Research 15(1), 100–109 (1984)
Garey, M.R., Johnson, D.S.: Strong NP-completeness results: Motivations, examples, and implications. J. of the ACM 25, 499–508 (1978)
Gens, G.V., Levner, E.V.: Computational complexity of approximation algorithms for combinatorial problems. In: Proc. of the 8th Int. Symp. on Mathematical Foundations of Computer Science, pp. 292–300 (1979)
Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proc. of SODA, pp. 223–232 (2000)
Ghandeharizadeh, S., Muntz, R.R.: Design and implementation of scalable continuous media servers. Parallel Computing J. 24(1), 91–122 (1998)
Ibarra, O.H., Kim, C.E.: Fast Approximation for the Knapsack and the Sum of Subset Problems. J. of the ACM 22(4), 463–468 (1975)
Kashyap, S., Khuller, S.: Algorithms for Non-Uniform Size Data Placement on Parallel Disks (2003) (submitted)
Korte, B., Schrader, R.: On the existence of fast approximation schemes. In: Magasarian, O., Meyer, R., Robinson, S. (eds.) Nonlinear Programming, vol. 4, pp. 415–437. Academic Press, London (1981)
Sahni, S.: Approximate Algorithms for the 0/1 knapsack problem. J. of the ACM 22, 115–124 (1975)
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. J. of Scheduling 4(6), 313–338 (2001)
Shachnai, H., Tamir, T.: Approximation Schemes for Generalized 2-dimensional Vector Packing with Application to Data Placement, http://www.cs.technion.ac.il/~hadas/PUB/vpsd.ps
Shmoys, D.S., Tardos, E.: Scheduling unrelated machines with Costs. In: Proc. of SODA (1993)
Woeginger, G.J.: There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters 64(6), 293–297 (1997)
Wolf, J.L., Yu, P.S., Shachnai, H.: Disk load balancing for video-on-demand systems. ACM Multimedia Systems J. 5, 358–370 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shachnai, H., Tamir, T. (2003). 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) Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. RANDOM APPROX 2003 2003. Lecture Notes in Computer Science, vol 2764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45198-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-45198-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40770-6
Online ISBN: 978-3-540-45198-3
eBook Packages: Springer Book Archive