The problem MAXIMUM K-SET PACKING, the variation in which the cardinality of
all sets in C are bounded from above by a constant
,
is APX-complete [265], and is approximable within
for any
[250].
Variation of MAXIMUM K-SET PACKING in which the sets have positive weights and
the objective is to
maximize the total weight of the sets in the set packing is approximable
within
for any
[29] for
and within 2(k+1)/3 [90].
If the number of occurrences in C of
any element is bounded by a constant B for
the problem is APX-complete [69] and
approximable within B, even for the weighted variation of
the problem [231].