Abstract
Motivated by fundamental optimization problems in video delivery over wireless networks, we consider the following problem of packing resizable items (PRI). Given is a bin of capacity B > 0, and a set I of items. Each item j ∈ I is of size s j > 0. A packed item must stay in the bin for a fixed time interval. To accommodate more items in the bin, each item j can be compressed to a size p j ∈ [0,s j ) for at most a fraction q j ∈ [0,1) of the packing interval. The goal is to pack in the bin, for the given time interval, a subset of items of maximum cardinality. PRI is strongly NP-hard already for highly restricted instances.
Our main result is an approximation algorithm that packs, for any instance I of PRI, at least \(\frac{2}{3}OPT(I) -3\) items, where OPT(I) is the number of items packed in an optimal solution. Our algorithm yields better ratio for instances in which the maximum compression time of an item is \(q_{max} \in (0, \frac 1 2)\). For subclasses of instances arising in realistic scenarios, we give an algorithm that packs at least OPT(I) − 2 items. Finally, we show that a non-trivial subclass of instances admits an asymptotic fully polynomial time approximation scheme (AFPTAS).
Work partially supported by the Technion V.P.R. Fund, by Smoler Research Fund, and by the Ministry of Trade and Industry MAGNET program through the NEGEV Consortium ( www.negev-initiative.org ).
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
Albagli-Kim, S., Epstein, L., Shachnai, H., Tamir, T.: Packing Resizable Items with Application to Video Delivery over Wireless Networks. full version, http://www.cs.technion.ac.il/~hadas/PUB/PRI_full.pdf
Assman, S.B., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On a dual version of the one dimensional bin packing problem. J. Algorithms 5(4), 502–525 (1984)
The Cisco Visual Networking Index (VNI), http://www.cisco.com/en/US/netsol
Chaiken, S., Kleitman, D.J., Saks, M., Shearer, J.: Covering regions by rectangles. SIAM. J. on Algebraic and Discrete Methods 2(4), 394–410 (1981)
Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Proc. of SODA, pp. 213–222 (2000)
Csirik, J., Frenk, J.B., Galambos, G., Rinnooy Kan, A.H.G.: Probabilistic analysis of algorithms for dual bin packing problems. J. Algorithms 12, 189–203 (1991)
Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: Proceedings of SODA, pp. 557–566 (2001)
Fitzek, F.H.P., Hendrata, S., Seeling, P., Reisslein, M.: Video Streaming in Wireless Internet. CRC Press (2004)
Furht, B., Ahson, S.A. (eds.): Handbook of Mobile Broadcasting: DVB-H, DMB, ISDB-T, AND MEDIAFLO. Auerbach Publications (2008)
Franzblau, D.S., Kleitman, D.J.: An algorithm for covering polygons with rectangles. Information and Control Archive (1986)
Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theoretical Computer Science 306, 543–551 (2003)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems (2004)
Kenyon, C., Kenyon, R.: Tiling a Polygon with Rectangles. In: FOCS (1992)
Lee, C.C., Lee, D.T.: A simple on-line packing algorithm. J. of the ACM 32(3) (1985)
Pisinger, D.: Algorithms for Knapsack problems, Ph.D. Thesis, Dept. of Computer Science, University of Copenhagen, Denmark (February 1995)
Sahni, S.: Approximate algorithms for the 0/1 knapsack problem. J. of the ACM 22, 115–124 (1975)
Stoyan, Y., Romanova, T., Scheithauer, G., Krivulya, A.: Covering a polygonal region by rectangles. In: Computational Optimization and Applications (2009)
Tran, D.A., Nguyen, T.: Broadcasting techniques for video on demand in wireless networks. In: Handbook of Mobile Broadcasting. CRC Press (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albagli-Kim, S., Epstein, L., Shachnai, H., Tamir, T. (2013). Packing Resizable Items with Application to Video Delivery over Wireless Networks. In: Bar-Noy, A., Halldórsson, M.M. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2012. Lecture Notes in Computer Science, vol 7718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36092-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36091-6
Online ISBN: 978-3-642-36092-3
eBook Packages: Computer ScienceComputer Science (R0)