基于多变量子程序的精确算法
Exact Algorithms via Multivariate Subroutines
摘要:
我们考虑一族$Φ$ -子集问题,其中输入由大小为$n$的论域$U_I$上大小为$N$的实例$I$组成,并且任务是检查论域是否包含具有属性$Φ$的子集(例如,$Φ$可以是作为大小至多为$k$的输入图的反馈顶点集的属性)。我们的主要工具是一个简单的随机算法,解决$Φ$ -子集的时间$(1+b-\frac{1}{c})^n N^{O(1)}$,提供了一个算法的$Φ$ -扩展问题的运行时间$b^{n-|X|} c^k N^{O(1)}$。这里,$Φ$ -Extension的输入是大小为$n$的全域$U_I$上的大小为$N$的实例$I$、子集$X\subseteq U_I$和整数$k$,并且任务是检查是否存在具有$X\subseteq Y \subseteq U_I$和具有属性$Φ$的$|Y\setminus X|\le k$的集合$Y$。我们去随机化这个算法的成本增加了运行时间的一个次指数因子在$n$,我们适应它的枚举设置,我们需要枚举的属性$Φ$的所有子集的宇宙。这概括了Fomin等人[STOC 2016]的结果,Fomin等人证明了$b=1$。作为案例研究,我们使用这些结果来设计更快的确定性算法:-检查一个图是否有一个反馈顶点集的大小最多$k$ -枚举所有最小的反馈顶点集-枚举所有最小顶点覆盖的大小最多$k$,和-枚举所有最小的3-命中集。我们得到这些结果,通过推导相应的$Φ$ -扩展问题(或枚举变体)的新的$b^{n-|X|} c^k N^{O(1)}$时间算法。在某些情况下,这是通过调整现有算法的分析来完成的,或者在其他情况下,通过设计新算法来完成。我们的分析基于测量和征服,但要最小化的值$1+b-\frac{1}{c}$是非常规的,需要非凸优化。
英文摘要:
We consider the family of $Φ$-Subset problems, where the input consists of an instance $I$ of size $N$ over a universe $U_I$ of size $n$ and the task is to check whether the universe contains a subset with property $Φ$ (e.g., $Φ$ could be the property of being a feedback vertex set for the input graph of size at most $k$). Our main tool is a simple randomized algorithm which solves $Φ$-Subset in time $(1+b-\frac{1}{c})^n N^{O(1)}$, provided that there is an algorithm for the $Φ$-Extension problem with running time $b^{n-|X|} c^k N^{O(1)}$. Here, the input for $Φ$-Extension is an instance $I$ of size $N$ over a universe $U_I$ of size $n$, a subset $X\subseteq U_I$, and an integer $k$, and the task is to check whether there is a set $Y$ with $X\subseteq Y \subseteq U_I$ and $|Y\setminus X|\le k$ with property $Φ$. We derandomize this algorithm at the cost of increasing the running time by a subexponential factor in $n$, and we adapt it to the enumeration setting where we need to enumerate all subsets of the universe with property $Φ$. This generalizes the results of Fomin et al. [STOC 2016] who proved the case where $b=1$. As case studies, we use these results to design faster deterministic algorithms for: - checking whether a graph has a feedback vertex set of size at most $k$ - enumerating all minimal feedback vertex sets - enumerating all minimal vertex covers of size at most $k$, and - enumerating all minimal 3-hitting sets. We obtain these results by deriving new $b^{n-|X|} c^k N^{O(1)}$-time algorithms for the corresponding $Φ$-Extension problems (or enumeration variant). In some cases, this is done by adapting the analysis of an existing algorithm, or in other cases by designing a new algorithm. Our analyses are based on Measure and Conquer, but the value to minimize, $1+b-\frac{1}{c}$, is unconventional and requires non-convex optimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。