On the Advice Complexity of One-Dimensional Online Bin Packing

DOI10.1007/978-3-319-08016-1_29zbMath1409.68343OpenAlexW279205284MaRDI QIDQ3188859

Hong Shen, Xiaofan Zhao

Publication date: 2 September 2014

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08016-1_29

zbMATH Keywords

competitive ratioonline algorithmbin packingcomputation with advice

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Parallel online algorithms for the bin packing problem

This page was built for publication: On the Advice Complexity of One-Dimensional Online Bin Packing