Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering

DOI10.1007/978-3-662-49529-2_35zbMath1475.68464arXiv1512.04719OpenAlexW2204184450MaRDI QIDQ2802961

Carsten Fischer, Heiko Röglin

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.04719

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Relative Worst-Order Analysis: A Survey ⋮ Online bin covering with limited migration ⋮ Best fit bin packing with random order revisited ⋮ Online Bin Covering with Limited Migration ⋮ Best Fit Bin Packing with Random Order Revisited

This page was built for publication: Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering