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

更快的指数时间近似算法使用近似单调局部搜索

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

CISPA Helmholtz Center for Information Security(CISPA 赫尔姆霍兹信息安全中心);Simon Fraser University(西蒙菲莎大学);Max Planck Institute for Informatics(马克斯·普朗克 informatics 研究所)

Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

AI总结:

本文提出了一种基于近似单调局部搜索的方法,改进了多个NP难问题的指数时间近似算法,如顶点覆盖问题。

摘要:

我们扩展了Fomin、Gaspers、Lokshtanov和Saurabh [J. ACM 2019] 的单调局部搜索方法,通过建立参数化近似与单调子集最小化问题的指数时间近似算法之间的联系。在单调子集最小化问题中,输入隐含地描述了一个在大小为n的宇宙上闭合于取超集的非空集合族。任务是找到该族中的最小基数集合。广义而言,我们使用近似单调局部搜索来证明,一个运行时间为c^k·n^{O(1)}的参数化α-近似算法,其中k是解的大小,可以用来推导一个运行时间为d^n·n^{O(1)}的α-近似随机算法,其中d是唯一满足d∈(1,1+(c-1)/α)的值,使得D(1/α‖(d-1)/(c-1))=ln c/α,其中D(a‖b)是Kullback-Leibler散度。这种运行时间与Fomin等人对于α=1时的结果相同,并且当α>1时,对于任何c>1,都严格更优。此外,我们还展示了该结果可以去随机化,但会以运行时间中的亚指数乘法因子为代价。我们通过推导新的、更快的指数近似算法来展示近似单调局部搜索的潜力,这些算法适用于顶点覆盖、3-击中集、有向反馈顶点集、有向子集反馈顶点集、有向奇环消去和无向多割问题。例如,我们得到了一个顶点覆盖的1.1近似算法,运行时间为1.114^n·n^{O(1)},优于Bourgeois等人[DAM 2011]之前最好的1.1近似算法,其运行时间是1.127^n·n^{O(1)}。

英文摘要:

We generalize the monotone local search approach of Fomin, Gaspers, Lokshtanov and Saurabh [J. ACM 2019], by establishing a connection between parameterized approximation and exponential-time approximation algorithms for monotone subset minimization problems. In a monotone subset minimization problem the input implicitly describes a non-empty set family over a universe of size $n$ which is closed under taking supersets. The task is to find a minimum cardinality set in this family. Broadly speaking, we use approximate monotone local search to show that a parameterized $α$-approximation algorithm that runs in $c^k \cdot n^{O(1)}$ time, where $k$ is the solution size, can be used to derive an $α$-approximation randomized algorithm that runs in $d^n \cdot n^{O(1)}$ time, where $d$ is the unique value in $d \in (1,1+\frac{c-1}α)$ such that $\mathcal{D}(\frac{1}α\|\frac{d-1}{c-1})=\frac{\ln c}α$ and $\mathcal{D}(a \|b)$ is the Kullback-Leibler divergence. This running time matches that of Fomin et al. for $α=1$, and is strictly better when $α>1$, for any $c > 1$. Furthermore, we also show that this result can be derandomized at the expense of a sub-exponential multiplicative factor in the running time. We demonstrate the potential of approximate monotone local search by deriving new and faster exponential approximation algorithms for Vertex Cover, $3$-Hitting Set, Directed Feedback Vertex Set, Directed Subset Feedback Vertex Set, Directed Odd Cycle Transversal and Undirected Multicut. For instance, we get a $1.1$-approximation algorithm for Vertex Cover with running time $1.114^n \cdot n^{O(1)}$, improving upon the previously best known $1.1$-approximation running in time $1.127^n \cdot n^{O(1)}$ by Bourgeois et al. [DAM 2011].

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

↑