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

优先Steiner树问题的近似算法

Approximation algorithms for priority Steiner tree problems

Faryad Darabi Sahneh, Stephen Kobourov, Richard Spence

摘要:

在优先级Steiner树(PST)问题中,我们给出了一个无向图$G=(V,E)$,它有一个源$s \in V$和终端$T \subseteq V \setminus \{s\}$,其中每个终端$v \in T$需要一个非负优先级$P(v)$ .我们的目标是计算一个最小的权重Steiner树包含边的变化率,使路径从$s$到每个终端$v$包括边的速率大于或等于$P(v)$。具有$k$优先级的PST问题允许$\min\{2 \ln |T| + 2, kρ\}$近似[Charikar等人,2004],并且对于一些恒定的$c$,难以用比率$c \log \log n$近似[Chuzhoy等人,2008年]。在本文中,我们首先加强了[Charikar等人,2004],以显示$(2 \ln |T| + 2)$的近似比,然后提供实现相同近似比的非常简单的可并行化算法。然后,我们考虑一个更困难的节点加权版本的PST问题,并提供了一个$(2 \ln |T|+2)$近似使用扩展的蜘蛛分解[克莱因\&拉维,1995年]。这是第一个结果的PST问题的节点加权图。此外,所有上述算法的逼近比是紧的。

英文摘要:

In the Priority Steiner Tree (PST) problem, we are given an undirected graph $G=(V,E)$ with a source $s \in V$ and terminals $T \subseteq V \setminus \{s\}$, where each terminal $v \in T$ requires a nonnegative priority $P(v)$. The goal is to compute a minimum weight Steiner tree containing edges of varying rates such that the path from $s$ to each terminal $v$ consists of edges of rate greater than or equal to $P(v)$. The PST problem with $k$ priorities admits a $\min\{2 \ln |T| + 2, kρ\}$-approximation [Charikar et al., 2004], and is hard to approximate with ratio $c \log \log n$ for some constant $c$ [Chuzhoy et al., 2008]. In this paper, we first strengthen the analysis provided by [Charikar et al., 2004] for the $(2 \ln |T| + 2)$-approximation to show an approximation ratio of $\lceil \log_2 |T| \rceil + 1 \le 1.443 \ln |T| + 2$, then provide a very simple, parallelizable algorithm which achieves the same approximation ratio. We then consider a more difficult node-weighted version of the PST problem, and provide a $(2 \ln |T|+2)$-approximation using extensions of the spider decomposition by [Klein \& Ravi, 1995]. This is the first result for the PST problem in node-weighted graphs. Moreover, the approximation ratios for all above algorithms are tight.

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

↑