Olver, Neil and Shepherd, Bruce
(2010)
*Approximability of robust network design.*
In: ACM-SIAM Symposium on Discrete Algorithms, 2010-01-17 - 2010-01-19, Hyatt Regency Austin Austin, Texas.

## Abstract

We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by Ben-Ameur and Kerivin (2003), generalizes the well studied virtual private network (VPN) problem. Most research in this area has focused on ﬁnding constant factor approximations for speciﬁc polytope of demands, such as the class of hose matrices used in the deﬁnition of VPN. As pointed out in Chekuri (2007), however, the general problem was only known to be APX-hard (based on a reduction from the Steiner tree problem). We show that the general robust design is hard to approximate to within logarithmic factors. We establish this by showing a general reduction of buy-at-bulk network design to the robust network design problem. In the second part of the paper, we introduce a natural generalization of the VPN problem. In this model, the set of feasible demands is determined by a tree with edge capacities; a demand matrix is feasible if it can be routed on the tree. We give a constant factor approximation algorithm for this problem that achieves factor 8 in general, and 2 for the case where the tree has unit capacities.

Item Type: | Conference or Workshop Item (Paper) |
---|---|

Official URL: | https://archive.siam.org/meetings/da10/ |

Additional Information: | © 2010 The Author(s) |

Divisions: | Mathematics |

Subjects: | Q Science > QA Mathematics |

Date Deposited: | 24 Jan 2020 10:51 |

Last Modified: | 20 May 2020 01:19 |

URI: | http://eprints.lse.ac.uk/id/eprint/103169 |

### Actions (login required)

View Item |