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

$0$ -扩张的度量松弛允许一个$Ω(\log^{2/3}{k})$间隙

The Metric Relaxation for $0$-Extension Admits an $Ω(\log^{2/3}{k})$ Gap

Roy Schwartz, Nitzan Tur

摘要:

我们考虑的$0$ -扩展问题,在这里我们给出了一个无向图$\mathcal{G}=(V,E)$配备非负边权重$w:E\rightarrow \mathbb{R}^+$,一个集合$ T=\{ t_1,\ldots,t_k\}\subseteq V$的$k$特殊顶点称为终端,和一个半度量$D$在$T$。目标是将每个非终端顶点分配给终端,同时最小化所有边的权重乘以$D$中终端之间的距离的总和。$0$ -扩展承认两个已知的算法,实现$O(\log{k})$ [C{\displaystyle {\frac}linescu-Karloff-Rabani SICOMP '05]和$O(\log{k}/\log{\log{k}})$ [Fakcharoenphol-Harrelson-Rao-Talwar SODA '03]的近似。这两个已知的算法是基于舍入的自然线性规划松弛称为度量松弛,其中$D$是从$T$扩展到整个$V$。目前最著名的度量松弛的完整性间隙是$Ω(\sqrt{\log{k}})$。在这项工作中,我们提出了一个改进的完整性间隙的$Ω(\log^{\frac{2}{3}}k)$的度量松弛。我们的建设是基于一个图的随机扩展的另一个,一个概念,捕捉电梯的图作为一个特殊的情况下,可能是独立的利益。受代数拓扑的启发,我们的间隙实例的分析是基于证明在随机扩展中不存在连续部分(在拓扑意义上)。

英文摘要:

We consider the $0$-Extension problem, where we are given an undirected graph $\mathcal{G}=(V,E)$ equipped with non-negative edge weights $w:E\rightarrow \mathbb{R}^+$, a collection $ T=\{ t_1,\ldots,t_k\}\subseteq V$ of $k$ special vertices called terminals, and a semi-metric $D$ over $T$. The goal is to assign every non-terminal vertex to a terminal while minimizing the sum over all edges of the weight of the edge multiplied by the distance in $D$ between the terminals to which the endpoints of the edge are assigned. $0$-Extension admits two known algorithms, achieving approximations of $O(\log{k})$ [C{ă}linescu-Karloff-Rabani SICOMP '05] and $O(\log{k}/\log{\log{k}})$ [Fakcharoenphol-Harrelson-Rao-Talwar SODA '03]. Both known algorithms are based on rounding a natural linear programming relaxation called the metric relaxation, in which $D$ is extended from $T$ to the entire of $V$. The current best known integrality gap for the metric relaxation is $Ω(\sqrt{\log{k}})$. In this work we present an improved integrality gap of $Ω(\log^{\frac{2}{3}}k)$ for the metric relaxation. Our construction is based on the randomized extension of one graph by another, a notion that captures lifts of graphs as a special case and might be of independent interest. Inspired by algebraic topology, our analysis of the gap instance is based on proving no continuous section (in the topological sense) exists in the randomized extension.

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

↑