Probabilistic analysis of online (class-constrained) bin packing and bin covering
From MaRDI portal
Publication:2294707
DOI10.1007/978-3-319-77404-6_34zbMath1485.68317OpenAlexW2794235031MaRDI QIDQ2294707
Publication date: 12 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_34
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Online bin covering with limited migration ⋮ Best fit bin packing with random order revisited ⋮ Best Fit Bin Packing with Random Order Revisited
This page was built for publication: Probabilistic analysis of online (class-constrained) bin packing and bin covering