产品系列的代表集
Representative Sets of Product Families
摘要:
集合族${\cal F}$的一个子集${\cal F}'$称为$q$ -{ \em表示} ${\cal F}$,如果对于每个大小为$q$使得$A \cap B = \emptyset$的$A \in {\cal F}$和$B$,存在一个集合$A' \in {\cal F}'$使得$A' \cap B = \emptyset$。本文考虑了{ \em积}族${\cal F}$的$q$ -代表集的有效计算.如果存在${\cal A}$和${\cal B}$系列,则${\cal F}$系列是一个产品系列,因此${\cal F} = \{A \cup B~:~A \in {\cal A}, B \in {\cal B}, A \cap B = \emptyset\}$。我们的主要技术贡献是一个算法,给定${\cal A}$,${\cal B}$和$q$计算一个$q$代表家庭${\cal F}'$的${\cal F}$。我们的算法的运行时间是次线性的$|{\cal F}|$为许多选择${\cal A}$,${\cal B}$和$q$自然发生在几个动态规划算法。我们还给出了一个算法的计算$q$ -代表集的产品系列${\cal F}$在更一般的设置,$q$ -表示还涉及独立的拟阵除了不相交。该算法明显优于原始方法,在原始方法中,首先从${\cal A}$和${\cal B}$计算${\cal F}$,然后从${\cal F}$计算$q$代表族${\cal F}'$。我们给出了两个应用程序,我们的新算法计算$q$ -代表集的产品系列。第一种是多线性单项检测问题的$3.8408^{k}n^{O(1)}$确定性算法.第二个是一个显着的改进确定性动态规划算法的“连通性问题”的图有界树宽。
英文摘要:
A subfamily ${\cal F}'$ of a set family ${\cal F}$ is said to $q$-{\em represent} ${\cal F}$ if for every $A \in {\cal F}$ and $B$ of size $q$ such that $A \cap B = \emptyset$ there exists a set $A' \in {\cal F}'$ such that $A' \cap B = \emptyset$. In this paper, we consider the efficient computation of $q$-representative sets for {\em product} families ${\cal F}$. A family ${\cal F}$ is a product family if there exist families ${\cal A}$ and ${\cal B}$ such that ${\cal F} = \{A \cup B~:~A \in {\cal A}, B \in {\cal B}, A \cap B = \emptyset\}$. Our main technical contribution is an algorithm which given ${\cal A}$, ${\cal B}$ and $q$ computes a $q$-representative family ${\cal F}'$ of ${\cal F}$. The running time of our algorithm is sublinear in $|{\cal F}|$ for many choices of ${\cal A}$, ${\cal B}$ and $q$ which occur naturally in several dynamic programming algorithms. We also give an algorithm for the computation of $q$-representative sets for product families ${\cal F}$ in the more general setting where $q$-representation also involves independence in a matroid in addition to disjointness. This algorithm considerably outperforms the naive approach where one first computes ${\cal F}$ from ${\cal A}$ and ${\cal B}$, and then computes the $q$-representative family ${\cal F}'$ from ${\cal F}$. We give two applications of our new algorithms for computing $q$-representative sets for product families. The first is a $3.8408^{k}n^{O(1)}$ deterministic algorithm for the Multilinear Monomial Detection ($k$-MlD) problem. The second is a significant improvement of deterministic dynamic programming algorithms for "connectivity problems" on graphs of bounded treewidth.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。