arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.02830cs.DS
收藏

超立方体上Steiner树形图问题的参数化算法

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube

Sugyani Mahapatra, Manikandan Narayanan, N S Narayanaswamy

AI总结:

针对有向超立方体上的最小Steiner树形图问题,本文基于终端集、Steiner节点数、惩罚值三个参数,提出了多种精确、随机及近似算法,均利用超立方体结构实现关于参数的高效运行时间。

摘要:

受进化生物学中的系统发育重建问题启发,我们研究了有向超立方体上的最小Steiner树形图问题(MSA-DH)。给定表示有向超立方体$\u20d7{Q}_m$的参数$m$以及一组终端节点$R$,该问题要求找到一棵覆盖$R$且代价最小的Steiner树形图。由于$m$隐式表示了包含$2^m$个顶点的$\u20d7{Q}_m$,传统通用图上的Steiner树算法的运行时间分析无法清晰体现该问题的实际复杂度。我们提出了利用超立方体结构的算法,其运行时间关于$|R|$和$m$是多项式级的。\n我们从三个自然参数的角度研究MSA-DH问题:终端集$R$,以及两个超保证参数——Steiner节点数$p$和惩罚值$q$。对于超保证参数,参数化MSA-DH问题以$p \u2265 0$或$q\u2265 0$作为输入,分别输出边数至多为$|R| + p - 1$或$m + q$的Steiner树形图。我们得到以下结果($\tilde{\u2130}$隐藏多项式因子):\n1. 运行时间为$\tilde{\u2130}(3^{|R|})$的精确算法。\n2. 运行时间为$\tilde{\u2130}(9^q)$、成功概率$\u2265 4^{-q}$的随机算法。\n3. 运行时间为$\tilde{\u2130}(36^q)$的精确算法。\n4. 运行时间为$\tilde{\u2130}(1.25284^q)$的$(1+q)$近似算法。\n5. 运行时间为$\tilde{\u2130}(\u2113_{\u2130ax}^{p+2})$的$\u2130\u2009(p\u2113_{\u2130ax})$加性近似算法,其中$\u2113_{\u2130ax}$是任意终端到根的最大距离。

英文摘要:

Motivated by a phylogeny reconstruction problem in evolutionary biology, we study the minimum Steiner arborescence problem on directed hypercubes (MSA-DH). Given $m$, representing the directed hypercube $\vec{Q}_m$, and a set of terminals $R$, the problem asks to find a Steiner arborescence that spans $R$ with minimum cost. As $m$ implicitly represents $\vec{Q}_m$ comprising $2^{m}$ vertices, the running time analyses of traditional Steiner tree algorithms on general graphs does not give a clear understanding of the actual complexity of this problem. We present algorithms that exploit the structure of the hypercube and run in time polynomial in $|R|$ and $m$. We explore the MSA-DH problem on three natural parameters - $R$, and two above-guarantee parameters, number of Steiner nodes $p$ and penalty $q$. For above-guarantee parameters, the parameterized MSA-DH problem takes $p \geq 0$ or $q\geq 0$ as input, and outputs a Steiner arborescence with at most $|R| + p - 1$ or $m + q$ edges respectively. We present the following results ($\tilde{\mathcal{O}}$ hides the polynomial factors): 1. An exact algorithm that runs in $\tilde{\mathcal{O}}(3^{|R|})$ time. 2. A randomized algorithm that runs in $\tilde{\mathcal{O}}(9^q)$ time with success probability $\geq 4^{-q}$. 3. An exact algorithm that runs in $\tilde{\mathcal{O}}(36^q)$ time. 4. A $(1+q)$-approximation algorithm that runs in $\tilde{\mathcal{O}}(1.25284^q)$ time. 5. An $\mathcal{O}\left(p\ell_{\mathrm{max}} \right)$-additive approximation algorithm that runs in $\tilde{\mathcal{O}}(\ell_{\mathrm{max}}^{p+2})$ time, where $\ell_{\mathrm{max}}$ is the maximum distance of any terminal from the root.

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

↑