Sensitivity theorems in integer linear programming
Mathematical Programming: Series A and B
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
On the online bin packing problem
Journal of the ACM (JACM)
Approximate Max-Min Resource Sharing for Structured Concave Optimization
SIAM Journal on Optimization
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
A robust APTAS for the classical bin packing problem
Mathematical Programming: Series A and B
Online Scheduling with Bounded Migration
Mathematics of Operations Research
A robust PTAS for machine covering and packing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
New lower bounds for certain classes of bin packing algorithms
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |
In this paper we develop general LP and ILP techniques to find an approximate solution with improved objective value close to an existing solution. The task of improving an approximate solution is closely related to a classical theorem of Cook et al. [1] in the sensitivity analysis for LPs and ILPs. This result is often applied in designing robust algorithms for online problems. We apply our new techniques to the online bin packing problem, where it is allowed to reassign a certain number of items, measured by the migration factor. The migration factor is defined by the total size of reassigned items divided by the size of the arriving item. We obtain a robust asymptotic fully polynomial time approximation scheme (AFPTAS) for the online bin packing problem with migration factor bounded by a polynomial in $\frac{1}{\epsilon}$. This answers an open question stated by Epstein and Levin [2] in the affirmative. As a byproduct we prove an approximate variant of the sensitivity theorem by Cook at el. [1] for linear programs.