Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Robust AFPTAS for Online Bin Packing with Polynomial Migration   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. 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 in the affirmative. As a byproduct
we prove an approximate variant of the sensitivity theorem by Cook at el. for
linear programs.

15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
25
The categories of this paper are: patt-sol
14
The categories of this paper are: math-ph
33
The categories of this paper are: plasm-ph
16
The categories of this paper are: stat
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat