Document Open Access Logo

Robust Fault Tolerant Uncapacitated Facility Location

Authors Shiri Chechik, David Peleg



PDF
Thumbnail PDF

File

LIPIcs.STACS.2010.2454.pdf
  • Filesize: 297 kB
  • 12 pages

Document Identifiers

Author Details

Shiri Chechik
David Peleg

Cite AsGet BibTex

Shiri Chechik and David Peleg. Robust Fault Tolerant Uncapacitated Facility Location. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 191-202, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/LIPIcs.STACS.2010.2454

Abstract

In the {\em 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 {\em 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.
Keywords
  • Facility location
  • approximation algorithms
  • fault-tolerance

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail