A Short Proof of the VPN Tree Routing Conjecture on Ring Networks
Combinatorics
2011-11-10 v2 Optimization and Control
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.
Keywords
Cite
@article{arxiv.0710.3044,
title = {A Short Proof of the VPN Tree Routing Conjecture on Ring Networks},
author = {Fabrizio Grandoni and Volker Kaibel and Gianpaolo Oriolo and Martin Skutella},
journal= {arXiv preprint arXiv:0710.3044},
year = {2011}
}
Comments
Accepted for publication in Oper. Res. Lett.; referee's comments incorporated