Sciweavers

SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 9 months ago
Approximability of Robust Network Design
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 BenAmeu...
Neil Olver, F. Bruce Shepherd