Class constrained bin packing revisited

Leah Epstein; Csand Imreh; Asaf Levin

doi:10.1016/j.tcs.2010.04.037

Class constrained bin packing revisited

Leah Epstein, Csand Imreh, Asaf Levin

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the total number of colors of the items in S is at most k (which distinguishes our problem from the classical version). We follow earlier work on this problem and study the problem in both offline and online scenarios.

Original language	English
Pages (from-to)	3073-3089
Number of pages	17
Journal	Theoretical Computer Science
Volume	411
Issue number	34-36
DOIs	https://doi.org/10.1016/j.tcs.2010.04.037
State	Published - 17 Jul 2010

Bibliographical note

Funding Information:
This research was partially supported by the Hungarian National Foundation for Scientific Research, Grant F048587. E-mail addresses: [email protected] (L. Epstein), [email protected] (C. Imreh), [email protected] (A. Levin).

Keywords

AFPTAS
Bin packing
Online algorithms

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2010.04.037

Cite this

@article{f9e4d6c8d7d94bce8ac29cad0befa849,

title = "Class constrained bin packing revisited",

abstract = "We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the total number of colors of the items in S is at most k (which distinguishes our problem from the classical version). We follow earlier work on this problem and study the problem in both offline and online scenarios.",

keywords = "AFPTAS, Bin packing, Online algorithms",

author = "Leah Epstein and Csand Imreh and Asaf Levin",

note = "Funding Information: This research was partially supported by the Hungarian National Foundation for Scientific Research, Grant F048587. E-mail addresses: [email protected] (L. Epstein), [email protected] (C. Imreh), [email protected] (A. Levin).",

year = "2010",

month = jul,

day = "17",

doi = "10.1016/j.tcs.2010.04.037",

language = "English",

volume = "411",

pages = "3073--3089",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "34-36",

}

TY - JOUR

T1 - Class constrained bin packing revisited

AU - Epstein, Leah

AU - Imreh, Csand

AU - Levin, Asaf

N1 - Funding Information: This research was partially supported by the Hungarian National Foundation for Scientific Research, Grant F048587. E-mail addresses: [email protected] (L. Epstein), [email protected] (C. Imreh), [email protected] (A. Levin).

PY - 2010/7/17

Y1 - 2010/7/17

N2 - We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the total number of colors of the items in S is at most k (which distinguishes our problem from the classical version). We follow earlier work on this problem and study the problem in both offline and online scenarios.

AB - We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the total number of colors of the items in S is at most k (which distinguishes our problem from the classical version). We follow earlier work on this problem and study the problem in both offline and online scenarios.

KW - AFPTAS

KW - Bin packing

KW - Online algorithms

UR - http://www.scopus.com/inward/record.url?scp=77955429840&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2010.04.037

DO - 10.1016/j.tcs.2010.04.037

M3 - Article

AN - SCOPUS:77955429840

SN - 0304-3975

VL - 411

SP - 3073

EP - 3089

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 34-36

ER -

Class constrained bin packing revisited

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this