代表性家庭:一种统一的基于权衡的方法
Representative Families: A Unified Tradeoff-Based Approach
摘要:
令$M=(E,{\cal I})$是拟阵,并且令$\cal S$是$E$的大小为$p$的子集族。如果对于使得$X\cup Y\in{\cal I}$的每一对集合$X\in{\cal S}$和$Y\subseteq E\setminus X$,存在与$Y$不相交的集合$\widehat{X}\in\widehat{\cal S}$,使得$\widehat{X}\cup Y\in{\cal I}$,则亚科$\widehat{\cal S}\subseteq{\cal S}$表示${\cal S}$。Fomin等人(Proc. ACM-SIAM Symposium on Discrete Algorithms,2014)介绍了一种快速计算均匀拟阵代表族的强大技术。在本文中,我们表明,这种技术导致一个统一的方法,大大提高了一些经典问题的参数化算法的运行时间。其中包括$k$ -部分覆盖,$k$ -内部外分支和长定向循环。我们的方法利用了一个有趣的权衡之间的运行时间和代表性的家庭的大小。
英文摘要:
Let $M=(E,{\cal I})$ be a matroid, and let $\cal S$ be a family of subsets of size $p$ of $E$. A subfamily $\widehat{\cal S}\subseteq{\cal S}$ represents ${\cal S}$ if for every pair of sets $X\in{\cal S}$ and $Y\subseteq E\setminus X$ such that $X\cup Y\in{\cal I}$, there is a set $\widehat{X}\in\widehat{\cal S}$ disjoint from $Y$ such that $\widehat{X}\cup Y\in{\cal I}$. Fomin et al. (Proc. ACM-SIAM Symposium on Discrete Algorithms, 2014) introduced a powerful technique for fast computation of representative families for uniform matroids. In this paper, we show that this technique leads to a unified approach for substantially improving the running times of parameterized algorithms for some classic problems. This includes, among others, $k$-Partial Cover, $k$-Internal Out-Branching, and Long Directed Cycle. Our approach exploits an interesting tradeoff between running time and the size of the representative families.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。