Approximation algorithms for extensible bin packing

DOI10.1007/S10951-006-5594-5MaRDI QIDQ880529zbMATH OpenOpenAlexFDO

Authors George S. Lueker, E. G. jun. Coffman

Publication date 15 May 2007

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-006-5594-5

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation algorithms for extensible bin packing
• Approximation schemes for the generalized extensible bin packing problem
• A 13/12 approximation algorithm for bin packing with extendable bins
• Approximation and Online Algorithms
• An Efficient Approximation Scheme for Variable-Sized Bin Packing

Cites work

• A 13/12 approximation algorithm for bin packing with extendable bins
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Approximation algorithms for extensible bin packing
• Approximation schemes for scheduling on parallel machines
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305477 (Why is no real title available?)
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(19)

• Approximation algorithms for a hierarchically structured bin packing problem
• Tight approximations for resource constrained scheduling and bin packing
• Linear time-approximation algorithms for bin packing
• Packing items into several bins facilitates approximating the separable assignment problem
• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• Approximation algorithms for extensible bin packing
• A 13/12 approximation algorithm for bin packing with extendable bins
• Sum-of-squares heuristics for bin packing and memory allocation
• scientific article; zbMATH DE number 3913665 (Why is no real title available?)
• scientific article; zbMATH DE number 4051348 (Why is no real title available?)
• Improved Approximation for Vector Bin Packing
• Fast approximation methods for online scheduling of outpatient procedure centers
• Approximation and Online Algorithms
• Tight approximation algorithms for geometric bin packing with skewed items
• Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items
• Structure of polynomial-time approximation
• Online bin packing with overload cost
• Approximation schemes for the generalized extensible bin packing problem
• Maximizing data locality in distributed systems

This page was built for publication: Approximation algorithms for extensible bin packing

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