Robust Fault Tolerant uncapacitated facility location

Abstract : In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities. This paper concerns the robust fault-tolerant version of the uncapacitated facility location problem (RFTFL). In this problem, one or more facilities might fail, and each demand should be supplied by the closest open facility that did not fail. It is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities that did not fail, after the failure of up to \alpha facilities. We present a polynomial time algorithm that yields a 6.5-approximation for this problem with at most one failure and a 1.5 + 7.5\alpha-approximation for the problem with at most \alpha > 1 failures. We also show that the RFTFL problem is NP-hard even on trees, and even in the case of a single failure.
Document type :
Conference papers
Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.191-202, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. <http://arxiv.org/abs/0912.3188>
Liste complète des métadonnées


https://hal.inria.fr/inria-00456122
Contributor : Publications Loria <>
Submitted on : Friday, February 12, 2010 - 10:14:52 AM
Last modification on : Friday, February 12, 2010 - 4:50:47 PM
Document(s) archivé(s) le : Friday, June 18, 2010 - 8:20:21 PM

File

chechik.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00456122, version 1

Collections

Citation

Shiri Chechik, David Peleg. Robust Fault Tolerant uncapacitated facility location. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.191-202, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. <http://arxiv.org/abs/0912.3188>. <inria-00456122>

Share

Metrics

Record views

164

Document downloads

95