An improved approximation algorithm for virtual private network design
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1003253
- Experiments on virtual private network design with concave capacity costs
- Approximation algorithms for access network design
- scientific article; zbMATH DE number 1487924
- Simpler and better approximation algorithms for network design
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Approximation algorithms for certain network improvement problems
- Approximation algorithms for network design problems
- 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
Cited in
(12)- Competitive and deterministic embeddings of virtual networks
- scientific article; zbMATH DE number 1532269 (Why is no real title available?)
- Design of trees in the hose model: the balanced case
- Deterministic sampling algorithms for network design
- Experiments on virtual private network design with concave capacity costs
- scientific article; zbMATH DE number 1487924 (Why is no real title available?)
- Provisioning a virtual private network: a network design problem for multicommodity flow
- New Approaches for Virtual Private Network Design
- Connected facility location via random facility sampling and core detouring
- The VPN Problem with Concave Costs
- Automata, Languages and Programming
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
This page was built for publication: An improved approximation algorithm for virtual private network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921760)
