APTAS for bin packing with general cost structures

• Published in: Theoretical computer science Vol. 1055; p. 115510
• Main Authors: Jaykrishnan, G., Levin, Asaf
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 09.11.2025
• Subjects: Asymptotic approximation schemes; Bin packing; Cardinality constraints; Cardinality constraints; Bin packing; Asymptotic approximation schemes

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...