A Robust APTAS for the Classical Bin Packing Problem

DOI10.1007/11786986_20zbMATH Open1223.68127OpenAlexW1606368649MaRDI QIDQ3613761

Asaf Levin, Leah Epstein

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

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

Related Items (2)

A Robust PTAS for Machine Covering and Packing ⋮ Approximating robust bin packing with budgeted uncertainty

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)