Robust approximation schemes for cube packing

DOI10.1137/11082782XMaRDI QIDQ2848196zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation schememigration factormultidimensional packingrobust algorithm

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• A robust APTAS for the classical bin packing problem
• A Robust APTAS for the Classical Bin Packing Problem
• Approximation schemes for multidimensional packing
• Multidimensional cube packing
• Multidimensional cube packing

Cited in

(18)

• A robust APTAS for the classical bin packing problem
• Robust algorithms for total completion time
• Starting time minimization for the maximum job variant
• Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
• Robust online algorithms for dynamic choosing problems
• Online load balancing with general reassignment cost
• Efficient 1-space bounded hypercube packing algorithm
• Fully dynamic bin packing revisited
• Online bin covering with limited migration
• Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
• scientific article; zbMATH DE number 5371495 (Why is no real title available?)
• A Robust APTAS for the Classical Bin Packing Problem
• Robust algorithms for preemptive scheduling
• 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
• Online minimization of the maximum starting time: migration helps
• Tightness of sensitivity and proximity bounds for integer linear programs

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)