Asymptotic fully polynomial approximation schemes for variants of open-end bin packing

DOI10.1016/j.ipl.2008.08.005zbMath1191.68864OpenAlexW2001915926MaRDI QIDQ975519

Leah Epstein, Asaf Levin

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.005

zbMATH Keywords

approximation algorithmsbin packing

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (10)

Online bin packing with overload cost ⋮ On various open-end bin packing game ⋮ Open-end bin packing: new and old analysis approaches ⋮ A note on a variant of the online open end bin packing problem ⋮ Online minimization of the maximum starting time: migration helps ⋮ Set Covering with Ordered Replacement: Additive and Multiplicative Gaps ⋮ Hardness of lazy packing and covering ⋮ Starting time minimization for the maximum job variant ⋮ More on ordered open end bin packing ⋮ Offline black and white bin packing

Cites Work

• Unnamed Item
• Unnamed Item
• Online algorithms for a dual version of bin packing
• Bin packing can be solved within 1+epsilon in linear time
• Parameterized on-line open-end bin packing
• An asymptotic fully polynomial time approximation scheme for bin covering.
• On a dual version of the one-dimensional bin packing problem
• On Lazy Bin Covering and Packing Problems
• The Ordered Open-End Bin-Packing Problem
• Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
• A note on an open-end bin packing problem

This page was built for publication: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing