- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Fully Dynamic Bin Packing Revisited
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Fully Dynamic Bin Packing Revisited Berndt, Sebastian
Description
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is to minimize both the number of bins used as well as the amount of repacking. We measure the repacking by the migration factor, defined as the total size of repacked items divided by the size of an arriving or departing item. If one wishes to achieve an asymptotic competitive ration of 1 + for the number of bins, a relatively simple argument proves a lower bound of (1=) for the migration factor. We establish a nearly matching upper bound of O((1=)4 log(1=)) using a new dynamic rounding technique and new ideas to handle small items in a dynamic setting such that no amortization is needed. The running time of our algorithm is polynomial in the number of items n and in 1=. The previous best trade-o was for an asymptotic competitive ratio of 5=4 for the bins (rather than 1 +) and needed an amortized number of O(log n) repackings (while in our scheme the number of repackings is independent of n and non-amortized). Joint work with Klaus Jansen and Kim-Manuel Klein
Item Metadata
Title |
Fully Dynamic Bin Packing Revisited
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2015-12-03T11:04
|
Description |
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is to minimize both the number of bins used as well as the amount of repacking. We measure the repacking by the migration factor, defined as the total size of repacked items divided by the size of an arriving or departing item. If one wishes to achieve an asymptotic competitive ration of 1 + for the number of bins, a relatively simple argument proves a lower bound of (1=) for the migration factor. We establish a nearly matching upper bound of O((1=)4 log(1=)) using a new dynamic rounding technique and new ideas to handle small items in a dynamic setting such that no amortization is needed. The running time of our algorithm is polynomial in the number of items n and in 1=. The previous best trade-o was for an asymptotic competitive ratio of 5=4 for the bins (rather than 1 +) and needed an amortized number of O(log n) repackings (while in our scheme the number of repackings is independent of n and non-amortized). Joint work with Klaus Jansen and Kim-Manuel Klein
|
Extent |
24 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Universität zu Lübeck
|
Series | |
Date Available |
2016-06-07
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0304580
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International