magyar

A New Lower Bound for Classic Online Bin Packing

Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf: A New Lower Bound for Classic Online Bin Packing.
LECTURE NOTES IN COMPUTER SCIENCE, 11926. pp. 18-28. ISSN 0302-9743 (2020)

[thumbnail of 978-3-030-39479-0_2.pdf] Text
978-3-030-39479-0_2.pdf - Published Version
Closed access: Repository staff only
Download (377kB) | Request a copy
[thumbnail of 31141043_címlap_tartalom.pdf] Text
31141043_címlap_tartalom.pdf - Cover Image/Table of Contents
Download (61kB)
[thumbnail of NewLowerBoundONlineBP.pdf] Text
NewLowerBoundONlineBP.pdf - Accepted Version
Download (348kB)
Creators:
Balogh János MTMT
Békési József MTMT
Dósa György MTMT
Epstein Leah
Levin Asaf
Item Type: Journal Article
Journal or Publication Title: LECTURE NOTES IN COMPUTER SCIENCE
Date: 2020
Volume: 11926
Page Range: pp. 18-28
ISSN: 0302-9743
Faculty/Unit: Gyula Juhász Faculty of Education
Faculty of Science and Informatics
Institution: University of Szeged (2000-)
Language: English
MTMT rekordazonosító: 31141043
DOI azonosító: https://doi.org/10.1007/978-3-030-39479-0_2
Related URLs:
Date Deposited: 2023. Oct. 17. 13:16
Last Modified: 2023. Oct. 17. 14:58
URI: http://publicatio.bibl.u-szeged.hu/id/eprint/28438
Web of Science® Times Cited: 6 View citing articles in Web of Science®

Actions (login required)

View Item View Item
Technical information: publicatio AT ek.szte.hu
SZTE Repository of Publications is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.