A Robust APTAS for the Classical Bin Packing Problem

DOI10.1007/11786986_20MaRDI QIDQ3613761zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Asaf Levin

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_20

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• A robust APTAS for the classical bin packing problem
• Robust approximation schemes for cube packing
• A robust AFPTAS for online bin packing with polynomial migration
• A robust AFPTAS for online bin packing with polynomial migration
• Fully Dynamic Bin Packing

Cited in

(7)

• A robust APTAS for the classical bin packing problem
• Approximating robust bin packing with budgeted uncertainty
• Robust approximation schemes for cube packing
• A Robust PTAS for Machine Covering and Packing
• A robust AFPTAS for online bin packing with polynomial migration
• A robust AFPTAS for online bin packing with polynomial migration
• Robustly assigning unstable items

This page was built for publication: A Robust APTAS for the Classical Bin Packing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613761)