Robust approximation schemes for cube packing
From MaRDI portal
Publication:2848196
DOI10.1137/11082782XzbMATH Open1272.68457OpenAlexW2006073952MaRDI QIDQ2848196FDOQ2848196
Authors: Leah Epstein, Asaf Levin 
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
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40)
Cited In (18)
- Tightness of sensitivity and proximity bounds for integer linear programs
- Robust online algorithms for dynamic choosing problems
- Robust algorithms for total completion time
- Online minimization of the maximum starting time: migration helps
- Online Bin Covering with Limited Migration
- A robust AFPTAS for online bin packing with polynomial migration
- Online load balancing on uniform machines with limited migration
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- Title not available (Why is that?)
- Starting time minimization for the maximum job variant
- A robust APTAS for the classical bin packing problem
- Robust algorithms for preemptive scheduling
- Online load balancing with general reassignment cost
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
- Fully dynamic bin packing revisited
- Online bin covering with limited migration
- A Robust APTAS for the Classical Bin Packing Problem
- Efficient 1-space bounded hypercube packing algorithm
This page was built for publication: Robust approximation schemes for cube packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848196)
