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 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. 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).
Original language | English |
---|---|
Title of host publication | Algorithms for Sensor Systems - 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012, Revised Selected Papers |
Publisher | Springer Verlag |
Pages | 6-17 |
Number of pages | 12 |
ISBN (Print) | 9783642360916 |
DOIs | |
State | Published - 2012 |
Event | 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012 - Ljubljana, Slovenia Duration: 13 Sep 2012 → 14 Sep 2012 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 7718 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012 |
---|---|
Country/Territory | Slovenia |
City | Ljubljana |
Period | 13/09/12 → 14/09/12 |
Bibliographical note
Funding Information: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 ).
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science