## 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 α 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.

Original language | English |
---|---|

Pages (from-to) | 9-23 |

Number of pages | 15 |

Journal | Theoretical Computer Science |

Volume | 543 |

Issue number | C |

DOIs | |

State | Published - 2014 |

Externally published | Yes |

### Bibliographical note

Publisher Copyright:© 2014 Elsevier B.V.

## Keywords

- Approximation algorithms
- Facility location
- Fault-tolerance