Robust Approximation Schemes for Cube Packing
From MaRDI portal
Publication:2848196
DOI10.1137/11082782XzbMath1272.68457OpenAlexW2006073952MaRDI QIDQ2848196
Publication date: 25 September 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/11082782x
Analysis of algorithms (68W40) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40) Online algorithms; streaming algorithms (68W27)
Related Items (15)
Tightness of sensitivity and proximity bounds for integer linear programs ⋮ Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures ⋮ Online load balancing with general reassignment cost ⋮ Online load balancing on uniform machines with limited migration ⋮ Online minimization of the maximum starting time: migration helps ⋮ Online bin covering with limited migration ⋮ Robust algorithms for preemptive scheduling ⋮ Robust algorithms for total completion time ⋮ Lower bounds for several online variants of bin packing ⋮ Fully dynamic bin packing revisited ⋮ Online Bin Covering with Limited Migration ⋮ Starting time minimization for the maximum job variant ⋮ Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ Robust online algorithms for dynamic choosing problems
This page was built for publication: Robust Approximation Schemes for Cube Packing
