Bosman, Thomas and Olver, Neil 
ORCID: 0000-0001-8897-5459
(2017)
Exploring the tractability of the capped hose model.
In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA): ALGO 2017, 2018-09-04 - 2018-09-08, Vienna, Vienns, Austria, AUT.
Abstract
Robust network design concerns the design of networks to support uncertain or varying traffic patterns. An especially important case is the VPN problem, where the total traffic emanating from any node is bounded, but there are no further constraints on the traffic pattern. Recently, Fréchette et al. [INFOCOM, 2013] studied a generalization of the VPN problem where in addition to these so-called hose constraints, there are individual upper bounds on the demands between pairs of nodes. They motivate their model, give some theoretical results, and propose a heuristic algorithm that performs well on real-world instances. Our theoretical understanding of this model is limited; it is APX-hard in general, but tractable when either the hose constraints or the individual demand bounds are redundant. In this work, we uncover further tractable cases of this model; our main result concerns the case where each terminal needs to communicate only with two others. Our algorithms all involve optimally embedding a certain auxiliary graph into the network, and have a connection to a heuristic suggested by Fréchette et al. for the capped hose model in general.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Official URL: | https://drops.dagstuhl.de/opus/portals/lipics/inde... |
| Additional Information: | © 2017 The Author(s) |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 21 Jan 2020 00:28 |
| Last Modified: | 20 Dec 2024 00:59 |
| URI: | http://eprints.lse.ac.uk/id/eprint/103109 |
Actions (login required)
 |
View Item |
