Pages that link to "Item:Q5175994"
From MaRDI portal
The following pages link to Provisioning a virtual private network (Q5175994):
Displaying 50 items.
- Approximate robust optimization for the connected facility location problem (Q299099) (← links)
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- Benders decomposition of the passive optical network design problem (Q325394) (← links)
- A comparison of routing sets for robust network design (Q479214) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- Static and dynamic routing under disjoint dominant extreme demands (Q631210) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Experiments on virtual private network design with concave capacity costs (Q723484) (← links)
- Design of trees in the hose model: the balanced case (Q867917) (← links)
- A short proof of the VPN tree routing conjecture on ring networks (Q943799) (← links)
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Approximation algorithms for connected facility location problems (Q1016041) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut (Q1742250) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- A note on hierarchical hubbing for a generalization of the VPN problem (Q1785741) (← links)
- The General Steiner Tree-Star problem. (Q1853139) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- Generalized hose uncertainty in single-commodity robust network design (Q2182776) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- New discoveries of domination between traffic matrices (Q2401765) (← links)
- Data locality and replica aware virtual cluster embeddings (Q2405895) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment (Q2642500) (← links)
- On the robustness of potential-based flow networks (Q2689822) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- Provisioning virtual private networks under traffic uncertainty (Q3418126) (← links)
- LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
- Hardness of robust network design (Q3593369) (← links)
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
- (Q5111735) (← links)
- Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
