Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

DOI10.1137/050626259zbMath1167.90631OpenAlexW2125570197WikidataQ115525699 ScholiaQ115525699MaRDI QIDQ5900061

J. C. M. Keijsper, Leen Stougie, Cor A. J. Hurkens

Publication date: 22 May 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050626259

zbMATH Keywords

combinatorial optimizationdualitynetwork designmulticommodity flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)

Related Items (6)

Robust network design: Formulations, valid inequalities, and computations ⋮ Static and dynamic routing under disjoint dominant extreme demands ⋮ A short proof of the VPN tree routing conjecture on ring networks ⋮ A new genetic approach for transport network design and optimization ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ Exploring the Tractability of the Capped Hose Model

This page was built for publication: Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks