## Abstract

We introduce and study the maximum reliability coverage problem, where multiple facilities are to be located on a network whose arcs are subject to random failures. Our model assumes that arcs fail independently with non-uniform probabilities, and the objective is to locate a given number of facilities, aiming to maximize the expected demand serviced. In this context,each demand point is said to be serviced (or covered) when it is reachable from at least one facility by an operational path. The main contribution of this paper is to establish tight bounds on the approximability of maximum reliability coverage on bidirected trees as well as on general networks. Quite surprisingly, we show that this problem is NP-hard on bidirected trees via a carefully-constructed reduction from the partition problem. On the positive side, we make use of approximate dynamic programming ideas to devise an FPTAS on bidirected trees. For general networks, while maximum reliability coverage is (1 - 1 / e+ ϵ) -inapproximable as an extension of the max k-cover problem, even estimating its objective value is #P-complete, due to generalizing certain network reliability problems. Nevertheless, we prove that by plugging-in a sampling-based additive estimator into the standard greedy algorithm, a matching approximation ratio of 1 - 1 / e- ϵ can be attained.

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

Pages (from-to) | 2474-2501 |

Number of pages | 28 |

Journal | Algorithmica |

Volume | 82 |

Issue number | 9 |

DOIs | |

State | Published - 1 Sep 2020 |

### Bibliographical note

Publisher Copyright:© 2020, Springer Science+Business Media, LLC, part of Springer Nature.

## Keywords

- Dynamic programming
- Facility location
- FPTAS
- Hardness
- Random arc failures

## ASJC Scopus subject areas

- Computer Science (all)
- Computer Science Applications
- Applied Mathematics