Exploring the tractability of the capped hose model
From MaRDI portal
Publication:5111705
DOI10.4230/LIPICS.ESA.2017.19zbMATH Open1442.68008OpenAlexW2757379364MaRDI QIDQ5111705FDOQ5111705
Authors: Thomas Bosman, Neil Olver 
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2017.19
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cites Work
- Steiner Tree Approximation via Iterative Randomized Rounding
- Provisioning virtual private networks under traffic uncertainty
- Designing Least-Cost Nonblocking Broadband Networks
- From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
- The steiner problem in graphs
- Approximation via cost sharing
- New Approaches for Virtual Private Network Design
- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
- Title not available (Why is that?)
- A short proof of the VPN tree routing conjecture on ring networks
- A note on hierarchical hubbing for a generalization of the VPN problem
- Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
- The VPN Conjecture Is True
- The VPN Problem with Concave Costs
- Designing Overlapping Networks for Publish-Subscribe Systems
Cited In (1)
This page was built for publication: Exploring the tractability of the capped hose model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111705)
