A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Theory of linear and integer programming
Theory of linear and integer programming
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
Partially dynamic bin packing can be solved within 1 + &egr; in (amortized) polylogarithmic time
Information Processing Letters
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
SIAM Journal on Computing
Approximation algorithms
On the online bin packing problem
Journal of the ACM (JACM)
Algorithms for the Relaxed Online Bin-Packing Model
SIAM Journal on Computing
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Online Scheduling with Bounded Migration
Mathematics of Operations Research
Fast asymptotic FPTAS for packing fragmentable items with costs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Bin packing is a well studied problem which has many applications. In this paper we design a robust APTAS for the problem. The robust APTAS receives a single input item to be added to the packing at each step. It maintains an approximate solution throughout this process, by slightly adjusting the solution for each new item. At each step, the total size of items which may migrate between bins must be bounded by a constant factor times the size of the new item. We show that such a property cannot be maintained with respect to optimal solutions.