We obtain a factor 4 approximation to this problem through the application of various rounding techniques to the linear relaxation of an integer program ...

Jul 10, 2013 · In this paper, we consider the fault-tolerant k-median problem and give the \emph{first} constant factor approximation algorithm for it.

Abstract. In this paper, we consider the fault-tolerant k-median prob- lem and give the first constant factor approximation algo- rithm for it.

In this article, we consider the fault-tolerant k-median problem and give the first constant factor approximation algorithm for it. In the fault-tolerant ...

In this paper, we consider the fault-tolerant k-median problem and give the first constant factor approximation algorithm for it. In the fault-tolerant ...

Guha, S., A. Meyerson, and K. Munagala. “A constant factor approximation algorithm for the fault-tolerant facility location problem.” Journal of Algorithms 48, ...

The primal-dual algorithm for fault-tolerant facility location with uniform requirements also yields a 4-approximation algorithm for the fault-Tolerant ...

We consider a generalization of the classical facility location problem, where we require the solution to be fault-tolerant. In this generalization, every ...

In this article, we consider the fault-tolerant k-median problem and give the first constant factor approximation algorithm for it. In the fault-tolerant ...

We give a. 2.076-approximation algorithm for this problem using LP rounding, which is currently the best known performance guarantee. Our algorithm exploits ...