arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.01904cs.DS
收藏

平面图中从有向Steiner树到有向多拟阵Steiner树

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs

Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu

摘要:

在有向斯坦纳树(DST)问题中,输入是有向边加权图$G=(V,E)$、根顶点$r$和$k$终端的集合$S \subseteq V$。我们的目标是找到一个最小成本的子图,连接$r$到每个终端。DST允许准多项式时间的$O(\log^2 k/\log \log k)$ -近似,以及多项式时间的任何固定$ε> 0$的$O(k^ε)$ -近似。解决多项式时间多对数逼近的存在性问题是逼近算法中的一个主要问题。在最近的工作中,Friggstad和Mousavi [ICALP 2023]通过Thorup的最短路径分离定理获得了平面有向图中DST的简单而优雅的多项式时间$O(\log k)$ -近似。我们建立在他们的工作,并取得了一些新的成果DST和相关问题。- 我们通过对Friggstad和Mousavi [ICALP 2023]中递归的解释,开发了一种用于平面有向图中有根问题的树嵌入技术。利用这一点,我们得到多项式时间的多对数近似的群Steiner树,覆盖Steiner树,和多拟阵Steiner树问题的平面有向图。所有这些问题即使在树中也很难近似到$Ω(\log^2 n/\log \log n)$的因子内。- 我们证明了DST的自然割LP松弛在平面图中具有$O(\log^2 k)$的完整性间隙。这与一般图形成对比,其中已知该LP的完整性间隙为$Ω(k)$,并且对于某些固定的$δ> 0$为$Ω(n^δ)$。- 我们结合前面的结果与密度为基础的参数,以获得多根版本的平面有向图的问题的多对数近似。对于DST,我们的结果改进了Friggstad和Mousavi [ICALP 2023]的$O(R + \log k)$近似,当$R= ω(\log^2 k)$。

英文摘要:

In the Directed Steiner Tree (DST) problem the input is a directed edge-weighted graph $G=(V,E)$, a root vertex $r$ and a set $S \subseteq V$ of $k$ terminals. The goal is to find a min-cost subgraph that connects $r$ to each of the terminals. DST admits an $O(\log^2 k/\log \log k)$-approximation in quasi-polynomial time, and an $O(k^ε)$-approximation for any fixed $ε> 0$ in polynomial-time. Resolving the existence of a polynomial-time poly-logarithmic approximation is a major open problem in approximation algorithms. In a recent work, Friggstad and Mousavi [ICALP 2023] obtained a simple and elegant polynomial-time $O(\log k)$-approximation for DST in planar digraphs via Thorup's shortest path separator theorem. We build on their work and obtain several new results on DST and related problems. - We develop a tree embedding technique for rooted problems in planar digraphs via an interpretation of the recursion in Friggstad and Mousavi [ICALP 2023]. Using this we obtain polynomial-time poly-logarithmic approximations for Group Steiner Tree, Covering Steiner Tree, and the Polymatroid Steiner Tree problems in planar digraphs. All these problems are hard to approximate to within a factor of $Ω(\log^2 n/\log \log n)$ even in trees. - We prove that the natural cut-based LP relaxation for DST has an integrality gap of $O(\log^2 k)$ in planar graphs. This is in contrast to general graphs where the integrality gap of this LP is known to be $Ω(k)$ and $Ω(n^δ)$ for some fixed $δ> 0$. - We combine the preceding results with density based arguments to obtain poly-logarithmic approximations for the multi-rooted versions of the problems in planar digraphs. For DST our result improves the $O(R + \log k)$ approximation of Friggstad and Mousavi [ICALP 2023] when $R= ω(\log^2 k)$.

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

↑