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

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

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20724
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

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

Rico Zenklusen, Mehrshad Taziki
arXiv (Cornell University)
Complexity and Algorithms in Graphs
preprint

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

Rico Zenklusen, Mehrshad Taziki
preprint en

Abstract

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

arXiv (Cornell University)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon