arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.03702cs.CC
收藏

参数化集合覆盖问题的一个简单的产生间隙的约简

A Simple Gap-producing Reduction for the Parameterized Set Cover Problem

Bingkai Lin

摘要:

给定一个$n$ -顶点二部图$I=(S,U,E)$,集合覆盖问题的目标是找到$S$的一个最小子集,使得$U$中的每个顶点都与这个子集中的某个顶点相邻。将集合覆盖近似到$(1-o(1))\ln n$因子内是NP难的。如果我们使用最优解的大小$k$作为参数,那么它可以在$n^{k+o(1)}$时间内求解。一个自然的问题是:我们可以在$n^{k-ε}$时间内将集合覆盖近似为$o(\ln n)$因子吗?在最近的突破性结果中,Karthik,Laekhanukit和Manurangsi表明,假设强指数时间假设(SETH),对于任何可计算函数$f$,没有$f(k)\cdot n^{k-ε}$ -时间算法可以近似集合覆盖到低于$(\log n)^{\frac{1}{poly(k,e(ε))}}$的因子。本文提出了一个简单的产生间隙的约简,给定一个集合覆盖实例$I=(S,U,E)$和两个整数$k<h\le (1-o(1))\sqrt[k]{\log |S|/\log\log |S|}$,在$|U|^{h^k}\cdot |S|^{O(1)}$时间内输出一个新的集合覆盖实例$I'=(S,U',E')$和$|U'|=|U|^{h^k}|S|^{O(1)}$,使得:(1)如果$I$有$k$大小的解,则$I'$也有;(2)如果$I$没有$k$大小的解,则$I'$的每个解必须至少包含$h$顶点.设置$h=(1-o(1))\sqrt[k]{\log |S|/\log\log |S|}$,我们表明,假设设置,任何可计算的功能$f$,没有$f(k)\cdot n^{k-ε}$时间算法可以区分一组覆盖实例与$k$大小的解决方案和一个最小的解决方案的大小至少是$(1-o(1))\cdot \sqrt[k]{\frac{\log n}{\log\log n}}$。这改善了Karthik、Laekhanukit和Manurangsi的结果。

英文摘要:

Given an $n$-vertex bipartite graph $I=(S,U,E)$, the goal of set cover problem is to find a minimum sized subset of $S$ such that every vertex in $U$ is adjacent to some vertex of this subset. It is NP-hard to approximate set cover to within a $(1-o(1))\ln n$ factor. If we use the size of the optimum solution $k$ as the parameter, then it can be solved in $n^{k+o(1)}$ time. A natural question is: can we approximate set cover to within an $o(\ln n)$ factor in $n^{k-ε}$ time? In a recent breakthrough result, Karthik, Laekhanukit and Manurangsi showed that assuming the Strong Exponential Time Hypothesis (SETH), for any computable function $f$, no $f(k)\cdot n^{k-ε}$-time algorithm can approximate set cover to a factor below $(\log n)^{\frac{1}{poly(k,e(ε))}}$ for some function $e$. This paper presents a simple gap-producing reduction which, given a set cover instance $I=(S,U,E)$ and two integers $k<h\le (1-o(1))\sqrt[k]{\log |S|/\log\log |S|}$, outputs a new set cover instance $I'=(S,U',E')$ with $|U'|=|U|^{h^k}|S|^{O(1)}$ in $|U|^{h^k}\cdot |S|^{O(1)}$ time such that: (1) if $I$ has a $k$-sized solution, then so does $I'$; (2) if $I$ has no $k$-sized solution, then every solution of $I'$ must contain at least $h$ vertices. Setting $h=(1-o(1))\sqrt[k]{\log |S|/\log\log |S|}$, we show that assuming SETH, for any computable function $f$, no $f(k)\cdot n^{k-ε}$-time algorithm can distinguish between a set cover instance with $k$-sized solution and one whose minimum solution size is at least $(1-o(1))\cdot \sqrt[k]{\frac{\log n}{\log\log n}}$. This improves the result of Karthik, Laekhanukit and Manurangsi.

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

↑