Approximation schemes for the generalized extensible bin packing problem

DOI10.1007/s00453-021-00895-8OpenAlexW3215954826MaRDI QIDQ832515

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

schedulingapproximation schemesload balancing\(n\)-fold programming

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the efficiency of polynomial time approximation schemes
• 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
• Combinatorial optimization problems in wireless switch design
• On-line scheduling with extendable working time on a small number of machines
• Approximation schemes for scheduling on parallel machines
• Generalized \(p\)-center problems: Complexity results and approximation algorithms
• On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size
• The price of fixed assignments in stochastic extensible bin packing
• Parametrized complexity theory.
• Vector assignment schemes for asymmetric settings
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• Approximation schemes for covering and packing problems in image processing and VLSI
• Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers
• Approximation and Online Algorithms

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