Two-bounded-space bin packing revisited
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100641" target="_blank" >RIV/00216208:11320/11:10100641 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/11:00370294
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-23719-5_23" target="_blank" >http://dx.doi.org/10.1007/978-3-642-23719-5_23</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-23719-5_23" target="_blank" >10.1007/978-3-642-23719-5_23</a>
Alternative languages
Result language
angličtina
Original language name
Two-bounded-space bin packing revisited
Original language description
We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint).
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
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
19th Annual European Symposium on Algorithms
ISBN
978-3-642-23718-8
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
263-274
Publisher name
Springer
Place of publication
Berlin
Event location
Saarbrucken
Event date
Sep 5, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—