๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation algorithm for facility location with service installation costs

โœ Scribed by Dachuan Xu; Shuzhong Zhang

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
146 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this paper, we study the uncapacitated facility location problem with service installation costs depending on the type of service required. We propose a polynomial-time approximation algorithm with approximation ratio 1.808 which improves the previous approximation ratio of 2.391 of Shmoys, Swamy, and Levi.

๐Ÿ“œ SIMILAR VOLUMES

An approximation algorithm for the -leve
An approximation algorithm for the -level stochastic facility location problem
โœ Zhen Wang; Donglei Du; Adriana F. Gabor; Dachuan Xu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

We consider the k-level stochastic facility location problem. For this, we present an LP rounding algorithm that is 3-approximate. This result is achieved by a novel integer linear programming formulation that exploits the stochastic structure.