APTAS for bin packing with general cost structures

We consider the following generalization of the bin packing problem. We are given a set of items each of which is associated with a rational size in the interval [0,1], and a monotone non-decreasing non-negative cost function f defined over the cardinalities of the subsets of items. A feasible solut...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 1055; p. 115510
Main Authors Jaykrishnan, G., Levin, Asaf
Format Journal Article
LanguageEnglish
Published Elsevier B.V 09.11.2025
Subjects
Asymptotic approximation schemes
Bin packing
Cardinality constraints
Cardinality constraints
Bin packing
Asymptotic approximation schemes
Online AccessGet full text

Cover

More Information
Summary:We consider the following generalization of the bin packing problem. We are given a set of items each of which is associated with a rational size in the interval [0,1], and a monotone non-decreasing non-negative cost function f defined over the cardinalities of the subsets of items. A feasible solution is a partition of the set of items into bins subject to the constraint that the total size of items in every bin is at most 1. Unlike bin packing, the goal function is to minimize the total cost of the bins where the cost of a bin is the value of f applied on the cardinality of the subset of items packed into the bin. We present an APTAS for this strongly NP-hard problem. We also provide a complete complexity classification of the problem with respect to the choice of f.
ISSN:0304-3975
DOI:10.1016/j.tcs.2025.115510