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.5050OpenAlexW2053900376MaRDI QIDQ3083324

Leah Epstein, Asaf Levin

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




Related Items (25)

On the generalized bin packing problemBin packing with divisible item sizes and rejection penaltiesBounds for online bin packing with cardinality constraintsThe tight asymptotic approximation ratio of first fit for bin packing with cardinality constraintsBin packing with rejection revisitedAn AFPTAS for variable sized bin packing with general activation costsSelfish bin packing with cardinality constraintsOnline bin packing with cardinality constraints resolvedEPTAS for the dual of splittable bin packing with cardinality constraintCombinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penaltiesApproximation schemes for packing splittable items with cardinality constraintsBin packing with general cost structuresImproved results for a memory allocation problemBin covering with cardinality constraintsRobust algorithms for preemptive schedulingSet Covering with Ordered Replacement: Additive and Multiplicative GapsClass constrained bin packing revisitedBin packing with controllable item sizesSeveral methods of analysis for cardinality constrained bin packingUnnamed ItemApproximation Schemes for Machine Scheduling with Resource (In-)dependent Processing TimesUnnamed ItemSeveral methods of analysis for cardinality constrained bin packingImproved lower bounds for the online bin packing problem with cardinality constraintsOffline black and white bin packing




This page was built for publication: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items