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

不可逼近问题的时间逼近折衷

Time-Approximation Trade-offs for Inapproximable Problems

Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos

摘要:

在本文中,我们专注于不承认一个常数因子近似在多项式时间的问题,并探讨如何快速提高其近似性的允许运行时间逐渐增加,从多项式(分)指数。我们解决了许多问题:对于最小独立支配集、最大诱导路径、森林和树,对于任何$r(n)$,一个简单的已知方案给出了$r$在时间上的近似比,大约为$r^{n/r}$。我们表明,对于大多数$r$值,如果这个运行时间可以显着改善ETH将失败。对于最大极小顶点覆盖,我们给出了一个非平凡的$\sqrt{r}$ -时间逼近$2^{n/r}$ .我们用一个类似的紧结果来匹配它。我们也给出了一个$\log r$ -近似的最小ATSP在时间$2^{n/r}$和$r$ -近似的最大Grundy着色在时间$r^{n/r}$。此外,我们表明,最小集覆盖表现出一个奇怪的行为,在这个超多项式设置:对于任何$δ> 0$,它承认一个$m^δ$ -近似,其中$m$是集的数量,在准多项式时间。我们观察到,如果这样的比率可以在多项式时间内实现,ETH或投影游戏猜想将失败。

英文摘要:

In this paper we focus on problems which do not admit a constant-factor approximation in polynomial time and explore how quickly their approximability improves as the allowed running time is gradually increased from polynomial to (sub-)exponential. We tackle a number of problems: For Min Independent Dominating Set, Max Induced Path, Forest and Tree, for any $r(n)$, a simple, known scheme gives an approximation ratio of $r$ in time roughly $r^{n/r}$. We show that, for most values of $r$, if this running time could be significantly improved the ETH would fail. For Max Minimal Vertex Cover we give a non-trivial $\sqrt{r}$-approximation in time $2^{n/r}$. We match this with a similarly tight result. We also give a $\log r$-approximation for Min ATSP in time $2^{n/r}$ and an $r$-approximation for Max Grundy Coloring in time $r^{n/r}$. Furthermore, we show that Min Set Cover exhibits a curious behavior in this super-polynomial setting: for any $δ> 0$ it admits an $m^δ$-approximation, where $m$ is the number of sets, in just quasi-polynomial time. We observe that if such ratios could be achieved in polynomial time, the ETH or the Projection Games Conjecture would fail.

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

↑