The VPN conjecture is true

DOI10.1145/2487241.2487243MaRDI QIDQ5395715zbMATH OpenOpenAlexWikidataFDO

Authors Navin Goyal, Neil Olver, F. Bruce Shepherd

Publication date 17 February 2014

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/26959

zbMATH Keywords

network designoblivious routingrobust optimization

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Virtual private network design
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
• The VPN Problem with Concave Costs
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
• Provisioning a virtual private network: a network design problem for multicommodity flow

Cited in

(13)

• A note on hierarchical hubbing for a generalization of the VPN problem
• On the approximability of robust network design
• Generalized hose uncertainty in single-commodity robust network design
• On the robustness of potential-based flow networks
• The VPN Problem with Concave Costs
• Exploring the tractability of the capped hose model
• Single-sink fractionally subadditive network design
• Virtual private network design
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
• Robust algorithms for TSP and Steiner tree
• Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model
• A short proof of the VPN tree routing conjecture on ring networks

This page was built for publication: The VPN conjecture is true

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395715)