Online Bin Covering with Limited Migration
From MaRDI portal
Publication:5075753
DOI10.4230/LIPIcs.ESA.2019.18OpenAlexW2978046099MaRDI QIDQ5075753
Leah Epstein, Lars Rohwedder, Asaf Levin, Marten Maack, Sebastian Berndt, Klaus Jansen
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1904.06543
Related Items
Online minimization of the maximum starting time: migration helps, Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes, Robust online algorithms for dynamic choosing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Online bin covering: expectations vs. guarantees
- Robust algorithms for preemptive scheduling
- Class constrained bin covering
- A robust APTAS for the classical bin packing problem
- Online algorithms for a dual version of bin packing
- Optimal on-line algorithms for variable-sized bin covering
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Online variable sized covering
- Fully dynamic bin packing revisited
- Comparing online algorithms for bin packing problems
- Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering
- Robust Approximation Schemes for Cube Packing
- Online Scheduling with Bounded Migration
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- On a dual version of the one-dimensional bin packing problem
- Handbook of Approximation Algorithms and Metaheuristics
- Fully-Dynamic Bin Packing with Little Repacking
- Symmetry exploitation for online machine covering with bounded migration
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
- Lower bounds for several online variants of bin packing
