A robust APTAS for the classical bin packing problem

Leah Epstein, Asaf Levin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings
PublisherSpringer Verlag
Pages214-225
Number of pages12
ISBN (Print)3540359044, 9783540359043
DOIs
StatePublished - 2006
Event33rd International Colloquium on Automata, Languages and Programming, ICALP 2006 - Venice, Italy
Duration: 10 Jul 200614 Jul 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4051 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference33rd International Colloquium on Automata, Languages and Programming, ICALP 2006
Country/TerritoryItaly
CityVenice
Period10/07/0614/07/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A robust APTAS for the classical bin packing problem'. Together they form a unique fingerprint.

Cite this