跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20724 · v1

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

首次提交 2026-11-16 16:30
版本更新 2026-11-16 16:30
雷达观测 2026-11-17 13:07
arXiv ↗PDF ↗

摘要

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.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 16:30 · 最新观测版本

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

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.

查看此版本解读 →查看此版本原文 ↗