scientific article; zbMATH DE number 6767525
From MaRDI portal
Publication:5351895
DOI10.4230/LIPIcs.APPROX-RANDOM.2015.135zbMath1375.68223arXiv1411.0960MaRDI QIDQ5351895
Kim-Manuel Klein, Sebastian Berndt, Klaus Jansen
Publication date: 31 August 2017
Full work available at URL: https://arxiv.org/abs/1411.0960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (8)
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures ⋮ Unnamed Item ⋮ Online bin covering with limited migration ⋮ 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 ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration
This page was built for publication:
