AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
From MaRDI portal
Publication:3083324
DOI10.1137/090767613zbMath1211.68510arXiv0906.5050MaRDI QIDQ3083324
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.5050
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
90C27: Combinatorial optimization
68W25: Approximation algorithms
Related Items
Unnamed Item, Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times, On the generalized bin packing problem, Unnamed Item, Several methods of analysis for cardinality constrained bin packing, Several methods of analysis for cardinality constrained bin packing, EPTAS for the dual of splittable bin packing with cardinality constraint, Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties, An AFPTAS for variable sized bin packing with general activation costs, Selfish bin packing with cardinality constraints, Robust algorithms for preemptive scheduling, Bin packing with rejection revisited, Class constrained bin packing revisited, Bin packing with controllable item sizes, The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints, Bin packing with divisible item sizes and rejection penalties, Online bin packing with cardinality constraints resolved, Improved lower bounds for the online bin packing problem with cardinality constraints, Offline black and white bin packing, Approximation schemes for packing splittable items with cardinality constraints, Bin packing with general cost structures, Improved results for a memory allocation problem, Bin covering with cardinality constraints, Bounds for online bin packing with cardinality constraints, Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
