A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
From MaRDI portal
Publication:5326594
DOI10.1007/978-3-642-39206-1_50zbMath1336.68296OpenAlexW1648194979MaRDI QIDQ5326594
Kim-Manuel Klein, Klaus Jansen
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_50
Mixed integer programming (90C11) Combinatorial optimization (90C27) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (11)
Unnamed Item ⋮ Online bin covering with limited migration ⋮ Unnamed Item ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ Symmetry exploitation for online machine covering with bounded migration ⋮ Robust algorithms for total completion time ⋮ Fully dynamic bin packing revisited ⋮ Online Bin Covering with Limited Migration ⋮ Reallocation problems in scheduling ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ Robust online algorithms for dynamic choosing problems
This page was built for publication: A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
