70 search results - page 1 / 14 » An approximation algorithm for network design problems with ... |
OL
2008
13 years 4 months ago
2008
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...
FOCS
2010
IEEE
13 years 1 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
SODA
2010
ACM
14 years 1 months ago
2010
ACM
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...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...