Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
SIAM Journal on Discrete Mathematics
Design of trees in the hose model: The balanced case
Operations Research Letters
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the Complexity of the Asymmetric VPN Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximability of robust network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Network design via core detouring for problems without a core
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
INFORMS Journal on Computing
The VPN Problem with Concave Costs
SIAM Journal on Discrete Mathematics
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
Journal of the ACM (JACM)
Hi-index | 0.00 |
Only recently, Hurkens, Keijsper, and Stougie proved the VPN Tree Routing Conjecture for the special case of ring networks. We present a short proof of a slightly stronger result which might also turn out to be useful for proving the VPN Tree Routing Conjecture for general networks.