A new analysis of best fit bin packing
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F12%3A00387099" target="_blank" >RIV/67985840:_____/12:00387099 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-30347-0_31" target="_blank" >http://dx.doi.org/10.1007/978-3-642-30347-0_31</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-30347-0_31" target="_blank" >10.1007/978-3-642-30347-0_31</a>
Alternative languages
Result language
angličtina
Original language name
A new analysis of best fit bin packing
Original language description
We give a simple proof and a generalization of the classical result which says that the (asymptotic) approximation ratio of BestFit algorithm is 1.7. We generalize this result to a wide class of algorithms that are allowed to pack the incoming item to any bin with load larger than 1/2 (if it fits), instead to the most full bin, and at the same time this class includes the bounded-space variants of these algorithms.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA100190902" target="_blank" >IAA100190902: Mathematical logic, complexity, and algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
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
Fun with Algorithms
ISBN
978-3-642-30346-3
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
315-321
Publisher name
Springer
Place of publication
Heidelberg
Event location
Venice
Event date
Jun 4, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—