arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.07402cs.DScs.DM
收藏

部分重采样以近似覆盖整数规划

Partial resampling to approximate covering integer programs

Antares Chen, David G. Harris, Aravind Srinivasan

AI总结:

针对列稀疏覆盖整数规划,提出基于Lovász局部引理部分重采样变体的新舍入方案,获得改进的近似比,并证明几乎匹配的下界及负相关性,可处理多准则程序。

摘要:

我们考虑列稀疏覆盖整数规划,这是集合覆盖问题的一种推广,已有大量(随机化)近似算法的研究。我们开发了一种新的舍入方案,基于Harris和Srinivasan(2019)提出的Lovász局部引理的“部分重采样”变体。该方案实现了近似比为$1 + \frac{\ln (\Delta_1+1)}{a_{\min}} + O\left( \log\left(1 + \sqrt{ \frac{\log (\Delta_1+1)}{a_{\min}}} \right) \right)$,其中$a_{\min}$是最小覆盖约束,$\Delta_1$是覆盖矩阵(其条目缩放至$[0,1]$)任何列的最大$\ell_1$范数。当变量大小存在额外约束时,我们展示了近似比为$\ln \Delta_0 + O(\log \log \Delta_0)$(其中$\Delta_0$是覆盖矩阵任何列中非零条目的最大数量)。这些结果在多个方面渐近地改进了Srinivasan(2006)和Kolliopoulos与Young(2005)的结果。我们展示了几乎匹配的不可近似性和整数间隙下界。我们还表明,舍入过程导致变量之间的负相关性,这使我们能够处理多准则程序。

英文摘要:

We consider column-sparse covering integer programs, a generalization of set cover, which have a long line of research of (randomized) approximation algorithms. We develop a new rounding scheme based on the Partial Resampling variant of the Lovász Local Lemma developed by Harris & Srinivasan (2019). This achieves an approximation ratio of $1 + \frac{\ln (Δ_1+1)}{a_{\min}} + O\Big( \log(1 + \sqrt{ \frac{\log (Δ_1+1)}{a_{\min}}} \Big)$, where $a_{\min}$ is the minimum covering constraint and $Δ_1$ is the maximum $\ell_1$-norm of any column of the covering matrix (whose entries are scaled to lie in $[0,1]$). When there are additional constraints on the variable sizes, we show an approximation ratio of $\ln Δ_0 + O(\log \log Δ_0)$ (where $Δ_0$ is the maximum number of non-zero entries in any column of the covering matrix). These results improve asymptotically, in several different ways, over results of Srinivasan (2006) and Kolliopoulos & Young (2005). We show nearly-matching inapproximability and integrality-gap lower bounds. We also show that the rounding process leads to negative correlation among the variables, which allows us to handle multi-criteria programs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑