WorksComputer Science
Improved Approximation for Weighted -Set Packing via a Simple Two-Phase Approach
Abstract
Weighted -set packing asks for a maximum-weight collection of pairwise disjoint sets, each of cardinality at most . For every fixed , we give a polynomial-time algorithm with approximation factor , improving the previous best factor of through a simple two-phase approach. In a first phase, our algorithm constructs a packing by processing random weight buckets of varying widths with an unweighted packing algorithm. We show that a small expected weight of this packing relative to the optimum forces a large expected total surplus in the optimum. Surplus quantifies the potential for improving a packing through star swaps. In the second phase, we solve and round a configuration LP to turn sufficiently large surplus into an increase in expected weight. Our procedure can easily be derandomized.