Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/37201
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBöhm, Martin-
dc.contributor.authorSgall, Jiří-
dc.contributor.authorVan Stee, Rob-
dc.contributor.authorVeselý, Pavel-
dc.date.accessioned2016-04-08T09:22:21Z-
dc.date.available2016-04-08T09:22:21Z-
dc.date.issued2017-02-03-
dc.identifier.citationJournal of Combinatorial Optimization, 2017en
dc.identifier.issn1382-6905-
dc.identifier.urihttps://link.springer.com/article/10.1007/s10878-017-0114-4en
dc.identifier.urihttp://hdl.handle.net/2381/37201-
dc.descriptionThe conference version can be found at arXiv:1404.5569en
dc.descriptionAn erratum to this article is available at http://dx.doi.org/10.1007/s10878-017-0116-2.-
dc.descriptionThe original version of this article was revised: The original title of this article is “A two-phase algorithm for bin stretching with 4 stretching factor 1.5”. The title was inadvertently changed to “A two-phase algorithm 5 for bin stretching with stretching factor 1:5’.-
dc.description.abstractOnline Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of $1.5$ for any number of bins. We build on previous algorithms and use a two-phase approach. We also show that this approach cannot give better results by proving a matching lower bound.en
dc.description.sponsorshipSupported by the project 14-10003S of GA ČR and by the GAUK project 548214.-
dc.language.isoenen
dc.publisherSpringeren
dc.relation.urihttp://arxiv.org/abs/1601.08111v1-
dc.rightsThe file attached to this record is distributed under the Creative Commons “Attribution Non-Commercial No Derivatives” licence, further details of which can be found via the following link: http://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.subjectOnline algorithmsen
dc.subjectBin packingen
dc.subjectScheduling-
dc.titleA Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5en
dc.typeJournal Articleen
dc.identifier.doi10.1007/s10878-017-0114-4-
dc.identifier.eissn1573-2886-
dc.description.versionPost-printen
pubs.organisational-group/Organisationen
pubs.organisational-group/Organisation/COLLEGE OF SCIENCE AND ENGINEERINGen
pubs.organisational-group/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Scienceen
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
1601.08111v2.pdfPost-print409.74 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.