Chapter

Automata, Languages and Programming

Volume 4051 of the series Lecture Notes in Computer Science pp 214-225

A Robust APTAS for the Classical Bin Packing Problem

  • Leah EpsteinAffiliated withDepartment of Mathematics, University of Haifa
  • , Asaf LevinAffiliated withDepartment of Statistics, The Hebrew University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.