Approximation schemes for the generalized extensible bin packing problem

DOI10.1007/S00453-021-00895-8MaRDI QIDQ832515zbMATH OpenOpenAlexFDO

Authors Asaf Levin

Publication date 25 March 2022

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.09750

zbMATH Keywords

approximation schemesschedulingload balancing\(n\)-fold programming

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Recommendations

• Approximation algorithms for extensible bin packing
• Approximation algorithms for extensible bin packing
• An APTAS for Generalized Cost Variable-Sized Bin Packing
• Approximation and Online Algorithms
• scientific article; zbMATH DE number 5761817

Cites work

• scientific article; zbMATH DE number 6820261 (Why is no real title available?)
• scientific article; zbMATH DE number 7559087 (Why is no real title available?)
• scientific article; zbMATH DE number 6472625 (Why is no real title available?)
• A 13/12 approximation algorithm for bin packing with extendable bins
• An AFPTAS for variable sized bin packing with general activation costs
• Approximation algorithms for extensible bin packing
• Approximation algorithms for extensible bin packing
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size
• Approximation and Online Algorithms
• Approximation schemes for covering and packing problems in image processing and VLSI
• Approximation schemes for scheduling on parallel machines
• Combinatorial optimization problems in wireless switch design
• Fast approximation methods for online scheduling of outpatient procedure centers
• Generalized p-center problems: Complexity results and approximation algorithms
• On the efficiency of polynomial time approximation schemes
• On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
• On-line scheduling with extendable working time on a small number of machines
• Optimal allocation of surgery blocks to operating rooms under uncertainty
• Parametrized complexity theory.
• The price of fixed assignments in stochastic extensible bin packing
• Vector assignment schemes for asymmetric settings

Cited in

(6)

• Approximation algorithms for extensible bin packing
• Approximation algorithms for extensible bin packing
• A 13/12 approximation algorithm for bin packing with extendable bins
• Fast approximate PCPs for multidimensional bin-packing problems
• Approximation algorithms for a hierarchically structured bin packing problem
• On a generalized bin-packing problem

This page was built for publication: Approximation schemes for the generalized extensible bin packing problem

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