On the sum minimization version of the online bin covering problemI

János Csirik; Leah Epstein; Csanád Imreh; Asaf Levin

doi:10.1016/j.dam.2010.04.005

On the sum minimization version of the online bin covering problemI

János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin

Department of Mathematics

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

Abstract

Given a set of m identical bins of size 1, the online input consists of a (potentially infinite) stream of items in (0; 1]. Each item is to be assigned to a bin upon arrival. The goal is to cover all bins, that is, to reach a situation where a total size of items of at least 1 is assigned to each bin. The cost of an algorithm is the sum of all used items at the moment when the goal is first fulfilled. We consider three variants of the problem, the online problem, where there is no restriction of the input items, and the two semi-online models, where the items arrive sorted by size, that is, either by non-decreasing size or by non-increasing size. The offline problem is considered as well.

Original language	English
Pages (from-to)	1381-1393
Number of pages	13
Journal	Discrete Applied Mathematics
Volume	158
Issue number	13
DOIs	https://doi.org/10.1016/j.dam.2010.04.005
State	Published - 6 Jul 2010

Bibliographical note

Funding Information:
This research has been supported by the Hungarian National Foundation for Scientific Research , Grant F048587 . The work of Cs. Imreh was partially supported by the Bolyai Scholarship of the Hungarian Academy of Sciences.

Keywords

Bin covering
Online algorithms

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2010.04.005

Cite this

@article{6a7b50ef72604856ab18f5c9a3b70bb3,

title = "On the sum minimization version of the online bin covering problemI",

abstract = "Given a set of m identical bins of size 1, the online input consists of a (potentially infinite) stream of items in (0; 1]. Each item is to be assigned to a bin upon arrival. The goal is to cover all bins, that is, to reach a situation where a total size of items of at least 1 is assigned to each bin. The cost of an algorithm is the sum of all used items at the moment when the goal is first fulfilled. We consider three variants of the problem, the online problem, where there is no restriction of the input items, and the two semi-online models, where the items arrive sorted by size, that is, either by non-decreasing size or by non-increasing size. The offline problem is considered as well.",

keywords = "Bin covering, Online algorithms",

author = "J{\'a}nos Csirik and Leah Epstein and Csan{\'a}d Imreh and Asaf Levin",

note = "Funding Information: This research has been supported by the Hungarian National Foundation for Scientific Research , Grant F048587 . The work of Cs. Imreh was partially supported by the Bolyai Scholarship of the Hungarian Academy of Sciences. ",

year = "2010",

month = jul,

day = "6",

doi = "10.1016/j.dam.2010.04.005",

language = "English",

volume = "158",

pages = "1381--1393",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "13",

}

TY - JOUR

T1 - On the sum minimization version of the online bin covering problemI

AU - Csirik, János

AU - Epstein, Leah

AU - Imreh, Csanád

AU - Levin, Asaf

N1 - Funding Information: This research has been supported by the Hungarian National Foundation for Scientific Research , Grant F048587 . The work of Cs. Imreh was partially supported by the Bolyai Scholarship of the Hungarian Academy of Sciences.

PY - 2010/7/6

Y1 - 2010/7/6

N2 - Given a set of m identical bins of size 1, the online input consists of a (potentially infinite) stream of items in (0; 1]. Each item is to be assigned to a bin upon arrival. The goal is to cover all bins, that is, to reach a situation where a total size of items of at least 1 is assigned to each bin. The cost of an algorithm is the sum of all used items at the moment when the goal is first fulfilled. We consider three variants of the problem, the online problem, where there is no restriction of the input items, and the two semi-online models, where the items arrive sorted by size, that is, either by non-decreasing size or by non-increasing size. The offline problem is considered as well.

AB - Given a set of m identical bins of size 1, the online input consists of a (potentially infinite) stream of items in (0; 1]. Each item is to be assigned to a bin upon arrival. The goal is to cover all bins, that is, to reach a situation where a total size of items of at least 1 is assigned to each bin. The cost of an algorithm is the sum of all used items at the moment when the goal is first fulfilled. We consider three variants of the problem, the online problem, where there is no restriction of the input items, and the two semi-online models, where the items arrive sorted by size, that is, either by non-decreasing size or by non-increasing size. The offline problem is considered as well.

KW - Bin covering

KW - Online algorithms

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

U2 - 10.1016/j.dam.2010.04.005

DO - 10.1016/j.dam.2010.04.005

M3 - Article

AN - SCOPUS:84865675976

SN - 0166-218X

VL - 158

SP - 1381

EP - 1393

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 13

ER -

On the sum minimization version of the online bin covering problemI

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this