Approximation schemes for packing splittable items with cardinality constraints

Leah Epstein, Rob Van Stee

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

Abstract

We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be split, but each bin may contain at most k (parts of) items, where k is some fixed constant. Complicating the problem further is the fact that items may be larger than 1, which is the size of a bin. We close this problem by providing a polynomial-time approximation scheme for it. We first present a scheme for the case k∈=∈2 and then for the general case of constant k. Additionally, we present dual approximation schemes for k∈=∈2 and constant k. Thus we show that for any ε>∈0, it is possible to pack the items into the optimal number of bins in polynomial time, if the algorithm may use bins of size 1∈+∈ε.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers
Pages232-245
Number of pages14
DOIs
StatePublished - 2008
Event5th International Workshop on Approximation and Online Algorithms, WAOA 2007 - Eilat, Israel
Duration: 11 Oct 200712 Oct 2007

Publication series

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

Conference

Conference5th International Workshop on Approximation and Online Algorithms, WAOA 2007
Country/TerritoryIsrael
CityEilat
Period11/10/0712/10/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Approximation schemes for packing splittable items with cardinality constraints'. Together they form a unique fingerprint.

Cite this