Robust online algorithms for certain dynamic packing problems

DOI10.1007/978-3-030-39479-0_4MaRDI QIDQ2193079zbMATH OpenOpenAlexFDO

Authors Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof

Publication date 24 August 2020

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

zbMATH Keywords

competitive ratiodynamic algorithmsonline algorithmspacking problemsrecourse

Mathematics Subject Classification ID

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

Recommendations

• Fully dynamic bin packing revisited
• scientific article; zbMATH DE number 6767525
• Robust online algorithms for dynamic choosing problems
• A robust AFPTAS for online bin packing with polynomial migration
• A robust AFPTAS for online bin packing with polynomial migration

Cited in

(4)

• Robust online algorithms for dynamic choosing problems
• Online load balancing on uniform machines with limited migration
• Online minimization of the maximum starting time: migration helps
• Stable approximation algorithms for dominating set and independent set

This page was built for publication: Robust online algorithms for certain dynamic packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193079)