Dynamic bin packing with unit fraction items revisited

Authors:
Xin Han;Chao Peng;Deshi Ye;Dahai Zhang;Yan Lan
Affiliations:
School of Software of Dalian University of Technology, China;Shanghai Key Laboratory of Trustworthy Computing, School of Software Engineering, East China Normal University, Shanghai 200062, China;College of Computer Science, Zhejiang University, Hangzhou 310027, China;Key Laboratory of Marine Chemistry Theory and Technology, Ministry of Education, Ocean University of China, Qingdao 266100, China;Dalian Neusoft Institute of Information, China
Venue:
Information Processing Letters
Year:
2010

Citing 14
Cited 1

Bin packing with divisible item sizes

Journal of Complexity
An improved lower bound for on-line bin packing algorithms

Information Processing Letters
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Online computation and competitive analysis

Online computation and competitive analysis
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps

SIAM Journal on Computing
On the online bin packing problem

Journal of the ACM (JACM)
On-line Packing and Covering Problems

Developments from a June 1996 seminar on Online algorithms: the state of the art
Windows Scheduling Problems for Broadcast Systems

SIAM Journal on Computing
Xen and the art of virtualization

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Windows scheduling as a restricted version of bin packing

ACM Transactions on Algorithms (TALG)
Lower Bound for the Online Bin Packing Problem with Restricted Repacking

SIAM Journal on Computing
Dynamic bin packing of unit fractions items

Theoretical Computer Science
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis

Algorithmica
On-line windows scheduling of temporary items

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

On-line bin packing with restricted repacking

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we will study the problem of dynamic bin packing with unit fraction items. We focus on analyzing the First Fit (FF) algorithm on this problem. There are two main results: i) we give the first bound for the FF algorithm on cases when the largest item is at most 1/k; ii) we generalize the previous framework for analyzing FF and get an improved upper bound.