环形网络上VPN树路由猜想的一个简短证明
A Short Proof of the VPN Tree Routing Conjecture on Ring Networks
摘要：
VPN树路由猜想指出，对称虚拟专用网设计（sVPND）问题总是存在最优解，其中所有终端之间的路径形成树。直到最近，Hurkens、Keijlord和Stougie才在环网的特殊情况下证明了这个猜想。他们的证明是基于一个对偶线性规划对，有点复杂。我们提出了一个简短的证明一个稍微强的猜想，这也可能是有用的证明一般网络的VPN树路由猜想。
英文摘要：
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all terminals form a tree. Only recently, Hurkens, Keijsper, and Stougie gave a proof of this conjecture for the special case of ring networks. Their proof is based on a dual pair of linear programs and is somewhat in- volved. We present a short proof of a slightly stronger conjecture which might also turn out to be useful for proving the VPN Tree Routing Conjecture for general networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
