betaFeedback

WorksComputer Science

Improved Approximation for Weighted kk-Set Packing via a Simple Two-Phase Approach

Abstract

Weighted kk-set packing asks for a maximum-weight collection of pairwise disjoint sets, each of cardinality at most kk. For every fixed k∈Z≥1k\in\mathbb Z_{\geq1}, we give a polynomial-time algorithm with approximation factor (1−1/3)k+O(log⁡k)≈0.4226k+O(log⁡k)\left(1- 1/{\sqrt3} \right)k+O(\log k) \approx 0.4226k + O(\log k), improving the previous best factor of 0.4621k+O(k)0.4621k + O(\sqrt{k}) 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.

Paper details

vlnc:W_tnfmgkp6
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…