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

An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem

โœ Scribed by Kamal Jain; Vijay V. Vazirani

Publisher
Springer
Year
2003
Tongue
English
Weight
137 KB
Volume
38
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ 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.

The approximation gap for the metric fac
The approximation gap for the metric facility location problem is not yet closed
โœ Jaroslaw Byrka; Karen Aardal ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 150 KB

We consider the 1.52-approximation algorithm of Mahdian et al. for the metric uncapacitated facility location problem. We show that their algorithm does not close the gap with the lower bound on approximability, 1.463, by providing a construction of instances for which its approximation ratio is not