Provisioning a virtual private network
From MaRDI portal
Publication:5175994
DOI10.1145/380752.380830zbMath1323.68014MaRDI QIDQ5175994
Bülent Yener, Amit Kumar, Rajeev Rastogi, Anupam Gupta, Jon M. Kleinberg
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380830
68Q25: Analysis of algorithms and problem complexity
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
05C21: Flows in graphs
Related Items
Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem, Unnamed Item, Affine recourse for the robust network design problem: Between static and dynamic routing, Virtual private network design over the first Chvátal closure, Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem, Unnamed Item, Approximate robust optimization for the connected facility location problem, Combinatorial approximation algorithms for buy-at-bulk connected facility location problems, Benders decomposition of the passive optical network design problem, A comparison of routing sets for robust network design, Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE, Static and dynamic routing under disjoint dominant extreme demands, Dynamic vs. oblivious routing in network design, Branch-and-cut-and-price for capacitated connected facility location, LP-based approximation algorithms for facility location in buy-at-bulk network design, MIP models for connected facility location: a theoretical and computational study, Experiments on virtual private network design with concave capacity costs, Design of trees in the hose model: the balanced case, A short proof of the VPN tree routing conjecture on ring networks, Approximability and inapproximability of the minimum certificate dispersal problem, Approximation algorithms for connected facility location problems, A 6.55 factor primal-dual approximation algorithm for the connected facility location problem, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Black-box reductions for cost-sharing mechanism design, The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, A note on hierarchical hubbing for a generalization of the VPN problem, The General Steiner Tree-Star problem., General network design: a unified view of combined location and network design problems, Connected facility location via random facility sampling and core detouring, On the approximability of robust network design, A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design, Generalized hose uncertainty in single-commodity robust network design, The robust network loading problem with dynamic routing, New discoveries of domination between traffic matrices, Data locality and replica aware virtual cluster embeddings, A PTAS for the geometric connected facility location problem, Network design with a discrete set of traffic matrices, Hedging uncertainty: approximation algorithms for stochastic optimization problems, Meet and merge: approximation algorithms for confluent flows, Towards optimizing the deployment of optical access networks, An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment, A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract), Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems, Approximation Algorithms for Single and Multi-Commodity Connected Facility Location, Provisioning virtual private networks under traffic uncertainty, LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design, Hardness of robust network design
Cites Work
