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

Adriana F. Gabor, Jan C.W. van Ommeren

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)


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+\varepsilon, 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 + \varepsilon)$-approximation algorithm. For a special subclass of subadditive functions, we obtain a 2-approximation algorithm by reduction to the linear cost facility location problem.
Original languageUndefined
Article number10.1016/j.tcs.2006.04.013
Pages (from-to)289-300
Number of pages12
JournalTheoretical computer science
Issue number06EX1521/3
Publication statusPublished - 2006


  • EWI-8108
  • MSC-68W25
  • IR-63671
  • MSC-90B06
  • METIS-237592
  • MSC-60K30

Cite this