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

流稀疏化中包含Steiner节点的下界

Lower Bounds on Flow Sparsifiers with Steiner Nodes

National University of Singapore(新加坡国立大学);University of Minnesota Twin Cities(明尼苏达大学双城分校)

Yu Chen, Zihan Tan, Mingyang Yang

AI总结:

本文研究了流稀疏化中包含Steiner节点的下界,证明即使允许大量Steiner节点,质量仍无法显著提升。

摘要:

给定一个大规模图G,其k个顶点称为终端,质量为q的流稀疏化是一个小图G',它包含终端并保持这些终端之间的多商品流在乘法因子q≥1下不变。构造具有良好质量和小规模(|V(G')|)的流稀疏化一直是图压缩中的核心问题。最常见的构造流稀疏化的方法是收缩:首先计算图G中顶点的划分,然后将每个部分收缩成一个超节点以得到G'。当G'仅允许包含所有终端时,最佳质量被证明为O(logk/loglogk)和Ω(√(logk/loglogk))。在本文中,我们表明允许少量Steiner节点在提高质量方面帮助不大。具体来说,存在k终端图,即使允许k·2^{(logk)^{Ω(1)}}个Steiner节点在其基于收缩的流稀疏化中,质量仍为Ω((logk)^{0.3})。

英文摘要:

Given a large graph $G$ with a set of its $k$ vertices called terminals, a \emph{quality-$q$ flow sparsifier} is a small graph $G'$ that contains the terminals and preserves all multicommodity flows between them up to some multiplicative factor $q\ge 1$, called the \emph{quality}. Constructing flow sparsifiers with good quality and small size ($|V(G')|$) has been a central problem in graph compression. The most common approach of constructing flow sparsifiers is contraction: first compute a partition of the vertices in $V(G)$, and then contract each part into a supernode to obtain $G'$. When $G'$ is only allowed to contain all terminals, the best quality is shown to be $O(\log k/\log\log k)$ and $Ω(\sqrt{\log k/\log\log k})$. In this paper, we show that allowing a few Steiner nodes does not help much in improving the quality. Specifically, there exist $k$-terminal graphs such that, even if we allow $k\cdot 2^{(\log k)^{Ω(1)}}$ Steiner nodes in its contraction-based flow sparsifier, the quality is still $Ω\big((\log k)^{0.3}\big)$.

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

↑