Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
János Balogh, József Békési, György Dósa, Leah Epstein, and Asaf Levin. A New and Improved Algorithm for Online Bin Packing. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 5:1-5:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{balogh_et_al:LIPIcs.ESA.2018.5, author = {Balogh, J\'{a}nos and B\'{e}k\'{e}si, J\'{o}zsef and D\'{o}sa, Gy\"{o}rgy and Epstein, Leah and Levin, Asaf}, title = {{A New and Improved Algorithm for Online Bin Packing}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.5}, URN = {urn:nbn:de:0030-drops-94686}, doi = {10.4230/LIPIcs.ESA.2018.5}, annote = {Keywords: Bin packing, online algorithms, competitive analysis} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Janos Balogh, Jozsef Bekesi, Gyorgy Dosa, Leah Epstein, and Asaf Levin. Online Bin Packing with Cardinality Constraints Resolved. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{balogh_et_al:LIPIcs.ESA.2017.10, author = {Balogh, Janos and Bekesi, Jozsef and Dosa, Gyorgy and Epstein, Leah and Levin, Asaf}, title = {{Online Bin Packing with Cardinality Constraints Resolved}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.10}, URN = {urn:nbn:de:0030-drops-78514}, doi = {10.4230/LIPIcs.ESA.2017.10}, annote = {Keywords: Online algorithms, bin packing, cardinality constraints, lower bounds} }
Published in: LIPIcs, Volume 20, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
György Dósa and Jiri Sgall. First Fit bin packing: A tight analysis. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 538-549, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{dosa_et_al:LIPIcs.STACS.2013.538, author = {D\'{o}sa, Gy\"{o}rgy and Sgall, Jiri}, title = {{First Fit bin packing: A tight analysis}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {538--549}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.538}, URN = {urn:nbn:de:0030-drops-39630}, doi = {10.4230/LIPIcs.STACS.2013.538}, annote = {Keywords: Approximation algorithms, online algorithms, bin packing, First Fit} }
Feedback for Dagstuhl Publishing