TY - JOUR

T1 - Robust fault tolerant uncapacitated facility location

AU - Chechik, Shiri

AU - Peleg, David

N1 - Publisher Copyright:
© 2014 Elsevier B.V.

PY - 2014

Y1 - 2014

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.464-approximation for this problem with at most one failure and a 1.488 + 7.464α-approximation for the problem with at most α failures for a fixed α > 1 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.464-approximation for this problem with at most one failure and a 1.488 + 7.464α-approximation for the problem with at most α failures for a fixed α > 1 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=84926418997&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2014.05.013

DO - 10.1016/j.tcs.2014.05.013

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84926418997

SN - 0304-3975

VL - 543

SP - 9

EP - 23

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - C

ER -