Online bin packing: Old algorithms and new results
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10286486" target="_blank" >RIV/00216208:11320/14:10286486 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-08019-2_38" target="_blank" >http://dx.doi.org/10.1007/978-3-319-08019-2_38</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-08019-2_38" target="_blank" >10.1007/978-3-319-08019-2_38</a>
Alternative languages
Result language
angličtina
Original language name
Online bin packing: Old algorithms and new results
Original language description
In the bin packing problem we are given an instance consisting of a sequence of items with sizes between $0$ and $1$. The objective is to pack these items into the smallest possible number of bins of unit size. {sc FirstFit} and {sc BestFit} algorithmsare simple online algorithms introduced in early seventies, when it was also shown that their asymptotic approximation ratio is equal to $1.7$. We present a simple proof of this bound and survey recent developments that lead to the proof that also the absolute approximation ratio of these algorithms is exactly $1.7$. More precisely, if the optimum needs $OPT$ bins, the algorithms use at most $lfloor1.7cdotmbox{sc OPT}rfloor$ bins and for each value of $OPT$, there are instances that actually need so many bins. We also discuss bounded-space bin packing, where the online algorithm is allowed to keep only a fixed number of bins open for future items. In this model, a variant of {sc BestFit} also has asymptotic approximation ratio
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
10th Conference on Computability in Europe (CiE)
ISBN
978-3-319-08018-5
ISSN
0302-9743
e-ISSN
—
Number of pages
11
Pages from-to
362-372
Publisher name
Springer
Place of publication
Berlin
Event location
Budapest, Hungary
Event date
Jun 23, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—