TY - JOUR

T1 - Approximation algorithms for facility location problems with a special class of subadditive cost functions

AU - Gabor, A.F.

AU - Ommeren, van, J.C.W.

PY - 2006

Y1 - 2006

N2 - In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1+e,1)-reduction of the facility location problem with subadditive costs to the soft capacitated facility location problem, which implies the existence of a 2(1+e)-approximation algorithm. For a special subclass of subadditive functions, we obtain a 2-approximation algorithm by reduction to the linear cost facility location problem.

AB - In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1+e,1)-reduction of the facility location problem with subadditive costs to the soft capacitated facility location problem, which implies the existence of a 2(1+e)-approximation algorithm. For a special subclass of subadditive functions, we obtain a 2-approximation algorithm by reduction to the linear cost facility location problem.

U2 - 10.1016/j.tcs.2006.04.013

DO - 10.1016/j.tcs.2006.04.013

M3 - Article

SN - 0304-3975

VL - 363

SP - 289

EP - 300

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 3

ER -