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

带 Steiner 节点的 $0$-Extension 问题下界

Lower Bounds on $0$-Extension with Steiner Nodes

Yu Chen, Zihan Tan

AI总结:

本文研究允许 Steiner 节点的 $0$-Extension 变体,证明同一半度量 LP 松弛即便使用超线性数量 Steiner 节点,整性隙仍有 $\Omega(\log\log |T|)$ 下界。

摘要:

在 $0$-Extension 问题中,给定一个边加权图 $G=(V,E,c)$、顶点集合中称为终端的子集 $T\subseteq V$,以及 $T$ 上的一个半度量 $D$;目标是为每个非终端顶点找到一个到终端的指派 $f$,使所有边 $(u,v)\in E$ 上的边权 $c(u,v)$ 与 $u、v$ 所映射终端之间距离 $D(f(u),f(v))$ 的乘积之和最小。当前 $0$-Extension 的最佳近似算法基于对一种称为 semi-metric LP relaxation(半度量线性规划松弛)的线性规划松弛进行舍入。该 LP 的整性隙已有最佳上界 $O(\log |T|/\log\log |T|)$ 和最佳下界 $\Omega((\log |T|)^{2/3})$,并已被证明与割和流顶点稀疏化器的最佳质量密切相关。我们研究允许 Steiner 顶点时的 $0$-Extension 变体。具体而言,我们关注同一 semi-metric LP relaxation 对这一新问题的整性隙。由先前工作可知,这一新整性隙与带 Steiner 节点的割/流顶点稀疏化器可达到的质量密切相关,而后者是图压缩中的一个重要开放问题。我们的主要结果是:即使允许超线性数量 $O(|T|\log^{1-\varepsilon}|T|)$ 个 Steiner 节点,新的整性隙仍保持为超常数 $\Omega(\log\log |T|)$。

英文摘要:

In the $0$-Extension problem, we are given an edge-weighted graph $G=(V,E,c)$, a set $T\subseteq V$ of its vertices called terminals, and a semi-metric $D$ over $T$, and the goal is to find an assignment $f$ of each non-terminal vertex to a terminal, minimizing the sum, over all edges $(u,v)\in E$, the product of the edge weight $c(u,v)$ and the distance $D(f(u),f(v))$ between the terminals that $u,v$ are mapped to. Current best approximation algorithms on $0$-Extension are based on rounding a linear programming relaxation called the \emph{semi-metric LP relaxation}. The integrality gap of this LP, with best upper bound $O(\log |T|/\log\log |T|)$ and best lower bound $Ω((\log |T|)^{2/3})$, has been shown to be closely related to the best quality of cut and flow vertex sparsifiers. We study a variant of the $0$-Extension problem where Steiner vertices are allowed. Specifically, we focus on the integrality gap of the same semi-metric LP relaxation to this new problem. Following from previous work, this new integrality gap turns out to be closely related to the quality achievable by cut/flow vertex sparsifiers with Steiner nodes, a major open problem in graph compression. Our main result is that the new integrality gap stays superconstant $Ω(\log\log |T|)$ even if we allow a super-linear $O(|T|\log^{1-\varepsilon}|T|)$ number of Steiner nodes.

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

↑