Abstract: One of the most natural optimization problems is the k-SET PACKING problem, where given a family of sets of size at most k one should select a maximum size subfamily of pairwise disjoint ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results