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...
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
Abstract— The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of repl...
Sandjai Bhulai, Robert D. van der Mei, Mengxiao Wu
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...