A short proof of the VPN tree routing conjecture on ring networks
From MaRDI portal
(Redirected from Publication:943799)
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5485556 (Why is no real title available?)
- Design of trees in the hose model: the balanced case
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
Cited in
(4)
This page was built for publication: A short proof of the VPN tree routing conjecture on ring networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943799)