TY - GEN

T1 - Robust fault tolerant uncapacitated facility location

AU - Chechik, Shiri

AU - Peleg, David

PY - 2010

Y1 - 2010

N2 - 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 α 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α-approximation for the problem with at most α > 1 failures. We also show that the RFTFL problem is NP-hard even on trees, and even in the case of a single failure.

AB - 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 α 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α-approximation for the problem with at most α > 1 failures. We also show that the RFTFL problem is NP-hard even on trees, and even in the case of a single failure.

KW - Approximation algorithms

KW - Facility location

KW - Fault-tolerance

UR - http://www.scopus.com/inward/record.url?scp=84880289076&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.STACS.2010.2454

DO - 10.4230/LIPIcs.STACS.2010.2454

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84880289076

SN - 9783939897163

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 191

EP - 202

BT - STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science

T2 - 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010

Y2 - 4 March 2010 through 6 March 2010

ER -