The price of fixed assignments in stochastic extensible bin packing

DOI10.1007/978-3-030-04693-4_20OpenAlexW2889165423MaRDI QIDQ1757783

Guillaume Sagnol, Alexander Tesch, Daniel Schmidt genannt Waldschmidt

Publication date: 15 January 2019

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

zbMATH Keywords

stochastic schedulingapproximation algorithmsextensible bin packing

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Approximation schemes for the generalized extensible bin packing problem ⋮ Improved bounds for stochastic extensible bin packing under distributional assumptions ⋮ Adaptive Bin Packing with Overflow

This page was built for publication: The price of fixed assignments in stochastic extensible bin packing